Pagini recente » Cod sursa (job #397546) | Cod sursa (job #408488) | Cod sursa (job #2663129) | Cod sursa (job #2890489) | Cod sursa (job #15063)
Cod sursa(job #15063)
#include <stdio.h>
#define MAXN 34569
int N, T;
int x[MAXN], s[MAXN];
long long best[MAXN];
int main()
{
freopen("euro.in", "rt", stdin);
freopen("euro.out", "wt", stdout);
scanf("%d %d", &N, &T);
best[0] = 0;
int i, lst = 1;
for (i = 1; i <= N; i++)
{
scanf("%d", x + i);
s[i] = s[i - 1] + x[i];
best[i] = -(1LL << 60);
int j; long long S2 = 0;
for (j = lst; j <= i && j <= lst + 500; j++)
{
S2 = (long long)i * (s[i] - s[j - 1]);
if (best[j - 1] + S2 - T > best[i])
{
best[i] = best[j - 1] + S2 - T;
lst = j;
}
}
}
printf("%lld\n", best[N]);
return 0;
}