#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
int n;
cin>>n;
vector<int> a(n);
for(auto &i:a) cin>>i;
int ans = 0;
for(int l=0;l<n;l++){
map<int,int> frq;
int mx = 0;
for(int r=l;r<n;r++){
frq[a[r]] ++;
mx = max(mx , frq[a[r]]);
if(mx > (r - l + 1) / 2) ans ++;
}
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
57 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
39 ms |
348 KB |
Output is correct |
10 |
Correct |
40 ms |
600 KB |
Output is correct |
11 |
Correct |
40 ms |
348 KB |
Output is correct |
12 |
Correct |
40 ms |
456 KB |
Output is correct |
13 |
Correct |
40 ms |
344 KB |
Output is correct |
14 |
Correct |
40 ms |
348 KB |
Output is correct |
15 |
Correct |
40 ms |
348 KB |
Output is correct |
16 |
Correct |
40 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3012 ms |
1112 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
57 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
39 ms |
348 KB |
Output is correct |
10 |
Correct |
40 ms |
600 KB |
Output is correct |
11 |
Correct |
40 ms |
348 KB |
Output is correct |
12 |
Correct |
40 ms |
456 KB |
Output is correct |
13 |
Correct |
40 ms |
344 KB |
Output is correct |
14 |
Correct |
40 ms |
348 KB |
Output is correct |
15 |
Correct |
40 ms |
348 KB |
Output is correct |
16 |
Correct |
40 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
348 KB |
Output is correct |
18 |
Execution timed out |
3012 ms |
1112 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |