# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
977765 |
2024-05-08T10:40:34 Z |
Nexus |
Sequence (APIO23_sequence) |
C++17 |
|
2000 ms |
59100 KB |
//#include "sequence.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=3e5+9,M=2e18+9,L=18,mod=1e9+7;
ll n,x,y;
multiset<ll>s;
map<ll,ll>m;
int sequence(int N, vector<int> A) {
ll ans=1;
for(ll i=0;i<N;++i)
{
s.clear();
m.clear();
s.insert(A[i]);
auto k=s.begin();
//x=1;
for(ll j=i+1;j<N;++j)
{
s.insert(A[j]);
++m[A[j]];
ans=max(ans,m[*k]);
if((j-i)%2)++k,++x;
ans=max(ans,m[*k]);
//cout<<i<<' '<<j<<' '<<x<<'\n';
}
}
return ans;
}
/*
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
vector<int>v(n);
for(auto &i:v)cin>>i;
cout<<sequence(n,v);
}
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Execution timed out |
2056 ms |
54900 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2029 ms |
59100 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |