Pagini recente » Cod sursa (job #1550796) | Cod sursa (job #283183) | Cod sursa (job #978652) | Cod sursa (job #1922461) | Cod sursa (job #15006)
Cod sursa(job #15006)
#include <stdio.h>
#define MAXN 34569
int N, T;
int x[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;
for (i = 1; i <= N; i++)
{
scanf("%d", x + i);
best[i] = -(1LL << 60);
int j; long long S = 0;
for (j = i; j && i - j <= 1000; j--)
{
S += i * x[j];
if (best[j - 1] + S - T> best[i])
best[i] = best[j - 1] + S - T;
}
}
printf("%lld\n", best[N]);
return 0;
}