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;
const long long N = 2e3 + 5, inf = 1e17 + 5, mod = 1e9 + 7;
map<int, int> mp;
int freq[N][N];
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int n, sz = 0;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
{
cin >> arr[i];
mp[arr[i]] = 1;
}
for (auto &v : mp)
v.second = ++sz;
for (int i = 0; i < n; i++)
arr[i] = mp[arr[i]];
long long ans = 0;
for (int i = 0; i < n; i++)
{
int cnt = 0;
for (int j = i; j < n; j++)
{
freq[arr[j]][i]++;
if (freq[arr[j]][i] > cnt)
cnt = freq[arr[j]][i];
if (cnt > (j - i + 1) / 2)
ans++;
}
}
cout << ans;
}
/*
10
*/
# | 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... |