#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n,k,ans = 0,a;
cin>>n>>k;
vector<int> v;
for(int i=0; i<n; ++i) {
cin>>a;
v.push_back(a);
}
for(int i=0; i<n; ++i) {
int m = 0;
for(int j=0; j<n; ++j) {
m = max(v[j] - v[i] - k*(abs(j-i)),m);
}
ans += m;
}
cout<<ans<<endl;
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 | #include <vector> #include <algorithm> #include <iostream> using namespace std; int main() { int n,k,ans = 0,a; cin>>n>>k; vector<int> v; for(int i=0; i<n; ++i) { cin>>a; v.push_back(a); } for(int i=0; i<n; ++i) { int m = 0; for(int j=0; j<n; ++j) { m = max(v[j] - v[i] - k*(abs(j-i)),m); } ans += m; } cout<<ans<<endl; return 0; } |
English