QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#707301 | #6433. Klee in Solitary Confinement | sw7777# | WA | 5ms | 3740kb | C++20 | 849b | 2024-11-03 15:25:04 | 2024-11-03 15:25:05 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int inf=0x3f3f3f3f3f3f3f3f;
int n,k;
const int N=5e6+10;
const int eps=2e6;
vector<int> a[N+10];
int t[N];
map<int,int> vis;
int cal(int x){
int ans=0;
int sum=0;
for(auto it:a[x]){
sum+=it;
ans=max(sum,ans);
if(sum<0) sum=0;
}
return ans;
}
signed main (){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>t[i];
for(int i=1;i<=n;i++){
if(t[i]+k+eps>=0&&t[i]+k+eps<=N) a[t[i]+k+eps].push_back(1);
a[t[i]+eps].push_back(-1);
vis[t[i]]++;
}
int res=0;
for(auto it:vis){
int x=it.first;
res=max(res,it.second+cal(x+eps));
}
cout<<res<<endl;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 5ms
memory: 3616kb
input:
5 2 2 2 4 4 4
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: 0
Accepted
time: 5ms
memory: 3672kb
input:
7 1 3 2 3 2 2 2 3
output:
6
result:
ok 1 number(s): "6"
Test #3:
score: 0
Accepted
time: 5ms
memory: 3612kb
input:
7 1 2 3 2 3 2 3 3
output:
5
result:
ok 1 number(s): "5"
Test #4:
score: 0
Accepted
time: 5ms
memory: 3704kb
input:
9 -100 -1 -2 1 2 -1 -2 1 -2 1
output:
3
result:
ok 1 number(s): "3"
Test #5:
score: 0
Accepted
time: 5ms
memory: 3740kb
input:
200 121649 0 527189 -1000000 -306471 -998939 527189 -1000000 -1000000 0 527189 0 527189 0 527189 -306471 -998939 -306471 -306471 -306471 0 0 527189 527189 1000000 527189 -1000000 1000000 648838 -1000000 -998939 -998939 -998939 0 1000000 -1000000 -998939 527189 1000000 648838 -1000000 1000000 648838 ...
output:
37
result:
ok 1 number(s): "37"
Test #6:
score: 0
Accepted
time: 5ms
memory: 3736kb
input:
200 -454379 -385892 454379 -1000000 373644 -665078 -1000000 -1000000 454379 0 1000000 373644 -1000000 1000000 -385892 -1000000 373644 0 -665078 0 -665078 -1000000 -665078 -385892 -665078 -385892 454379 -665078 -385892 -1000000 454379 1000000 -385892 373644 454379 -1000000 -385892 -1000000 -385892 -1...
output:
40
result:
ok 1 number(s): "40"
Test #7:
score: -100
Wrong Answer
time: 2ms
memory: 3724kb
input:
200 0 451272 -1000000 677452 677452 0 18908 451272 677452 -233144 677452 451272 18908 -1000000 18908 -1000000 0 451272 0 -233144 677452 1000000 451272 1000000 18908 -1000000 0 -233144 451272 1000000 18908 677452 0 677452 0 677452 1000000 -233144 18908 451272 -1000000 -233144 18908 1000000 0 0 -23314...
output:
36
result:
wrong answer 1st numbers differ - expected: '35', found: '36'