Cod sursa(job #3315749)
| Utilizator | Data | 15 octombrie 2025 20:50:29 | |
|---|---|---|---|
| Problema | Euro | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define DIM 210001
#define int long long
using namespace std;
ifstream fin("euro.in");
ofstream fout("euro.out");
int dp[DIM], sp[DIM];
int n, i, t, x, j;
int32_t main(){
fin >> n >> t;
for(i=1;i<=n;i++){
fin >> x;
sp[i] = sp[i - 1] + x;
}
fill(dp + 1, dp + n + 1, -1e18);
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
dp[i] = max(dp[i], (sp[i] - sp[j - 1]) * i - t + dp[j - 1]);
fout << dp[n] << "\n";
}
