#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n, k; cin >> n >> k;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++)
cin >> a[i];
int ans = 0;
for(int i = 1; i <= n; i++) {
int res = 0;
for(int j = 1; j <= n; j++)
res = max(res, a[j] - k * abs(i - j));
ans += res - a[i];
} cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
// For Problem with file IO
// #ifndef CPH
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
// #endif
int t = 1;
// cin >> t;
while(t--) {
solve();
}
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 27 28 29 30 31 32 33 34 | #include<bits/stdc++.h> using namespace std; #define int long long void solve() { int n, k; cin >> n >> k; vector<int> a(n + 1); for(int i = 1; i <= n; i++) cin >> a[i]; int ans = 0; for(int i = 1; i <= n; i++) { int res = 0; for(int j = 1; j <= n; j++) res = max(res, a[j] - k * abs(i - j)); ans += res - a[i]; } cout << ans << '\n'; } signed main() { ios::sync_with_stdio(false); ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); // For Problem with file IO // #ifndef CPH // freopen(".in", "r", stdin); // freopen(".out", "w", stdout); // #endif int t = 1; // cin >> t; while(t--) { solve(); } return 0; } |
English