QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#372619 | #5435. Clamped Sequence | ucup-team3294# | TL | 1ms | 3564kb | C++23 | 756b | 2024-03-31 16:46:49 | 2024-03-31 16:46:51 |
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;
int min1=1e9,max1=-1e9;
for(int i=1; i<=n; i++) {
cin>>a[i];
// b[i]=a[i];
min1=min(min1,a[i]);
max1=max(max1,a[i]);
}
//sort(a+1,a+1+n);
for( l=min1;l<=max1;l++)
{
r=l+d;
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=1;
// cin>>t;
while(t--) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3564kb
input:
8 3 3 1 4 1 5 9 2 6
output:
15
result:
ok 1 number(s): "15"
Test #2:
score: -100
Time Limit Exceeded
input:
2 1 -1000000000 1000000000