QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#231642 | #6433. Klee in Solitary Confinement | sfjh | WA | 12ms | 99252kb | C++14 | 955b | 2023-10-29 15:02:09 | 2023-10-29 15:02:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define xx first
#define yy second
const int N=4e6+10;
const int INF=1e9+10;
int n,k;
int a[N];
vector<int> v[N];
signed main(){
ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
cin>>n>>k;
map<int,int> mp;
fer(i,1,n){
cin>>a[i];
a[i]+=N/2;
mp[a[i]]++;
v[a[i]].pb(a[i]);
v[a[i]+k].pb(a[i]);
}
int ans=0;
for(auto it:mp){
int nx=it.xx;
int ny=it.yy;
int cnt=0;
int mx=0;
for(int i:v[nx]){
if(i==nx-k){
cnt++;
mx=max(mx,cnt);
}
else{
cnt--;
if(cnt<0) cnt=0;
}
}
ans=max(ans,ny+mx);
}
cout<<ans<<endl;
}
//5
//4
//1 -3 2 -4
//11
//91 66 73 71 32 83 72 79 84 33 93
//12
//91 66 73 71 32 83 72 79 84 33 33 93
//13
//91 66 73 71 32 83 72 79 84 33 33 33 93
//1
//0
详细
Test #1:
score: 100
Accepted
time: 10ms
memory: 99060kb
input:
5 2 2 2 4 4 4
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: 0
Accepted
time: 12ms
memory: 97880kb
input:
7 1 3 2 3 2 2 2 3
output:
6
result:
ok 1 number(s): "6"
Test #3:
score: 0
Accepted
time: 4ms
memory: 97736kb
input:
7 1 2 3 2 3 2 3 3
output:
5
result:
ok 1 number(s): "5"
Test #4:
score: 0
Accepted
time: 12ms
memory: 99252kb
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: 10ms
memory: 98172kb
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: 12ms
memory: 97780kb
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: 10ms
memory: 97960kb
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:
105
result:
wrong answer 1st numbers differ - expected: '35', found: '105'