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 <bits/stdc++.h>
using namespace std;
int N,A[200005];
map<int,int> mp;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> N;
for (int i = 0; i < N; ++i) cin >> A[i];
long long ans = 0;
for (int i = 0; i < N; ++i) {
mp.clear();
int most = 0;
for (int j = i; j < N; ++j) {
most = max(most,++mp[A[j]]);
if (most * 2 > j-i+1) ans++;
}
}
cout << ans;
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... |