QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#614459 | #7904. Rainbow Subarray | wzxtsl# | WA | 32ms | 7792kb | C++23 | 968b | 2024-10-05 16:23:10 | 2024-10-05 16:23:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define int long long
int n,m;
const int N=2e6+7;
int a[N];
int b[N];
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i]=a[i]-i;
}
for(int i=1;i<n;i++){
b[i]=abs(a[i+1]-a[i]);
//cout<<b[i]<<" ";
}
//cout<<endl;
int i=1;
int j=1;
int ans=0;
int ma=0;
int sum=0;
while(j<=n-1&&i<=j){
if(i==j&&b[i]>m){
i++;
j++;
ans=0;
}else if(sum+b[j]<=m){
ans++;
ma=max(ma,ans);
sum+=b[j];
j++;
}else{
sum-=b[i];
ans--;
i++;
}
//cout<<i<<"!"<<j<<endl;
}
cout<<ma+1<<endl;
}
signed main(){
fast;
int t=1;
cin>>t;
while(t--){
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5692kb
input:
5 7 5 7 2 5 5 4 11 7 6 0 100 3 4 5 99 100 5 6 1 1 1 1 1 5 50 100 200 300 400 500 1 100 3
output:
4 3 5 1 1
result:
ok 5 lines
Test #2:
score: -100
Wrong Answer
time: 32ms
memory: 7792kb
input:
11102 2 167959139 336470888 134074578 5 642802746 273386884 79721198 396628655 3722503 471207868 6 202647942 268792718 46761498 443917727 16843338 125908043 191952768 2 717268783 150414369 193319712 6 519096230 356168102 262263554 174936674 407246545 274667941 279198849 9 527268921 421436316 3613460...
output:
1 3 3 2 5 6 7 2 4 1 3 1 1 3 2 2 7 7 6 6 1 6 6 2 3 3 1 5 6 6 3 4 3 8 3 7 5 6 2 1 4 3 1 2 4 5 4 4 4 1 4 5 1 6 3 5 4 6 1 6 3 3 1 4 4 4 3 2 2 4 2 3 9 1 5 3 2 4 5 1 5 5 4 3 8 4 3 6 2 4 4 7 5 3 5 2 1 4 2 4 3 4 6 1 3 1 2 2 5 4 1 6 7 1 7 4 5 4 5 8 5 7 3 2 7 4 5 5 2 6 2 4 1 5 4 3 2 2 4 1 2 1 4 4 6 3 6 3 2 3 ...
result:
wrong answer 2nd lines differ - expected: '4', found: '3'