Pagini recente » Cod sursa (job #1370215) | Cod sursa (job #1162167) | Cod sursa (job #1171601) | Cod sursa (job #1121693) | Cod sursa (job #2036135)
#include <stdio.h>
#include <stdlib.h>
int v[5000000], d[5000000];
int main(){
FILE *fin, *fout;
int n, k, i, st, dr, pret, cant;
long long s;
fin=fopen("deque.in", "r");
fout=fopen("deque.out", "w");
fscanf(fin, "%d%d", &n, &pret, &k);
st=0;
dr=-1;
s=0;
for(i=0;i<n;i++){
fscanf(fin, "%d%d", &v[i], &cant);
if(st<=dr && d[st]==i-k)
st++;
while(st<=dr && v[i]<=v[d[dr]]+(i-d[dr]*pret))
dr--;
d[++dr]=i;
s+=(long long)(v[d[st]]+(i-d[st]*pret))*(long long)cant;
printf("%lld\n", (long long)(v[d[st]]+(i-d[st]*pret)*(long long)cant));
}
fprintf(fout, "%lld", s);
fclose(fin);
fclose(fout);
return 0;
}