QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#372629 | #5435. Clamped Sequence | ucup-team3294# | TL | 0ms | 0kb | C++23 | 1016b | 2024-03-31 16:53:44 | 2024-03-31 16:53:44 |
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];
}
for(int k=-1000000;k<=1000000;k++){
for(int i=1; i<=n; i++) {
l=a[i]+k;
r=a[i]+d+k;
res=0;
for(int x=1; x<=n; x++) {
if(a[x]>=l&&a[x]<=r) {
b[x]=a[x];
}else if(a[x]<l) b[x]=l;
else if(a[x]>r) b[x]=r;
}
for(int j=2; j<=n; j++) {
res+=abs(b[j]-b[j-1]);
}
ans=max(ans,res);
}
}
for(int k=-1000000;k<=1000000;k++){
for(int i=1; i<=n; i++) {
l=a[i]-d+k;
r=a[i]+k;
res=0;
for(int x=1; x<=n; x++) {
if(a[x]>=l&&a[x]<=r) {
b[x]=a[x];
}else if(a[x]<l) b[x]=l;
else if(a[x]>r) b[x]=r;
}
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
Time Limit Exceeded
input:
8 3 3 1 4 1 5 9 2 6