diff options
| author | crupest <crupest@outlook.com> | 2021-02-28 21:13:14 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-28 21:13:14 +0800 |
| commit | 6461de18da5281e1f8e736205394b298ad44b7f4 (patch) | |
| tree | e992db130f2e56d834fefc7a8e8a78aaaeb7f8d3 | |
| parent | b25eccbca5d52fd5a839e62ea08b64ad93dc3191 (diff) | |
| download | crupest-6461de18da5281e1f8e736205394b298ad44b7f4.tar.gz crupest-6461de18da5281e1f8e736205394b298ad44b7f4.tar.bz2 crupest-6461de18da5281e1f8e736205394b298ad44b7f4.zip | |
import(solutions): Add problem 1210.
| -rw-r--r-- | works/solutions/acwing/1210.cpp | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/works/solutions/acwing/1210.cpp b/works/solutions/acwing/1210.cpp new file mode 100644 index 0000000..4c9c0ba --- /dev/null +++ b/works/solutions/acwing/1210.cpp @@ -0,0 +1,37 @@ +#include <iostream>
+
+int N;
+int seq[10000];
+
+int main() {
+ std::cin >> N;
+ for (int i = 0; i < N; i++) {
+ std::cin >> seq[i];
+ }
+
+ int count = N;
+
+ for (int start = 0; start < N; start++) {
+ int min = seq[start], max = seq[start];
+
+ for (int end = start + 1; end < N; end++) {
+ int current = seq[end];
+
+ if (current > max) {
+ max = current;
+ }
+
+ if (current < min) {
+ min = current;
+ }
+
+ if (max - min == end - start) {
+ count++;
+ }
+ }
+ }
+
+ std::cout << count;
+
+ return 0;
+}
|