QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#254022 | #7685. Barkley II | ucup-team134# | WA | 100ms | 4088kb | C++14 | 813b | 2023-11-17 22:38:18 | 2023-11-17 22:38:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=500050;
int sum[N];
void Add(int i,int x){
//printf("Add %i %i\n",i,x);
for(;i<N;i+=i&-i)sum[i]+=x;
}
int Get(int i){
int ans=0;
for(;i>0;i-=i&-i)ans+=sum[i];
return ans;
}
int Get(int l,int r){
return Get(r)-Get(l-1);
}
int main(){
int t;
scanf("%i",&t);
while(t--){
int n,m;
scanf("%i %i",&n,&m);
map<int,int> last;
int ans=1;
for(int i=1;i<=n;i++){
int x;
scanf("%i",&x);
if(last[x]){
Add(last[x],-1);
}
int pre=last[x];
ans=max(ans,Get(pre+1,i-1)-x);
last[x]=i;
Add(i,1);
}
for(int i=1;i<=n+1;i++){
ans=max(ans,Get(last[i]+1,n)-i);
}
printf("%i\n",ans);
for(auto it:last){
if(it.second!=0){
Add(it.second,-1);
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3796kb
input:
2 5 4 1 2 2 3 4 5 10000 5 2 3 4 1
output:
2 3
result:
ok 2 number(s): "2 3"
Test #2:
score: -100
Wrong Answer
time: 100ms
memory: 4088kb
input:
50000 10 19 12 6 1 12 11 15 4 1 13 18 10 8 8 7 6 7 6 2 2 3 4 8 10 6 3 2 6 6 5 2 3 4 5 6 10 11 6 3 7 9 2 1 2 10 10 4 10 6 6 1 2 6 1 1 3 4 2 1 10 9 8 5 3 9 1 7 5 5 1 1 10 5 1 4 3 2 5 4 5 3 5 2 10 14 3 8 12 10 4 2 3 13 7 3 10 14 5 5 12 2 8 1 13 9 8 5 10 7 5 5 6 6 1 5 3 7 3 4 10 7 5 1 4 6 1 6 4 3 7 5 10...
output:
6 5 4 4 2 4 3 7 4 4 4 5 2 3 6 6 7 5 7 6 5 5 6 2 6 8 7 2 5 5 6 2 2 3 4 5 3 3 7 3 2 5 6 1 3 5 3 3 3 8 6 6 5 7 4 4 5 4 6 6 6 3 7 3 6 3 3 7 7 6 6 7 4 3 3 4 4 6 3 4 6 6 4 5 5 9 4 5 7 5 3 5 2 2 5 6 6 8 4 3 4 5 5 5 7 7 3 2 6 5 3 5 4 4 5 6 6 5 6 7 7 4 5 7 4 7 3 7 6 6 6 5 4 2 5 4 2 3 6 5 2 6 5 5 4 3 5 6 6 6 ...
result:
wrong answer 1174th numbers differ - expected: '0', found: '1'