QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#372464 | #5435. Clamped Sequence | ucup-team3294# | WA | 0ms | 3608kb | C++23 | 934b | 2024-03-31 13:49:27 | 2024-03-31 13:49:28 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e3+5;
int a[N],b[N];
void solve(){
int n,ans=0,d,l,r,res=0,sum=0;
cin>>n>>d;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
sum/=n;
for(int i=sum-5000;i<=sum+5000;i++){
l=i;r=i+d;
res=0;
for(int x=1;x<=n;x++){
if(a[x]<l||a[x]>r){
if(a[x]<l) b[x]=l;
else if(a[x]>r) b[x]=r;
}
else b[x]=a[x];
}
for(int j=2;j<=n;j++){
res+=abs(b[j]-b[j-1]);
}
ans=max(ans,res);
}
for(int i=1;i<=n;i++){
l=a[i];r=a[i]+d;
res=0;
for(int x=1;x<=n;x++){
if(a[x]<l||a[x]>r){
if(a[x]<l) b[x]=l;
else if(a[x]>r) b[x]=r;
}
else b[x]=a[x];
}
for(int j=2;j<=n;j++){
res+=abs(b[j]-b[j-1]);
}
ans=max(ans,res);
}
cout<<ans<<"\n";
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
// cin>>t;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3608kb
input:
8 3 3 1 4 1 5 9 2 6
output:
result:
wrong answer Answer contains longer sequence [length = 1], but output contains 0 elements