This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = 0;
for (int l = 1; l <= n; l++) {
vector<int> cnt(3);
int mx = 0;
for (int r = l; r <= n; r++) {
cnt[a[r]]++;
mx = max(mx, cnt[a[r]]);
int tot = r - l + 1;
if (mx > tot/2 && (tot-mx) <= tot/2) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |