Pagini recente » Borderou de evaluare (job #1755087) | Cod sursa (job #1150763) | Cod sursa (job #1005601) | Cod sursa (job #2245923) | Cod sursa (job #2732301)
#include <iostream>
#include<fstream>
using namespace std;
long deq[100000];
int main()
{ifstream f("branza.in");
ofstream g("branza.out");
long n,t,suma=0;
int s;
f>>n;
f>>s;
f>>t;
long *a=new long[n];
long *b=new long[n];
for(int i=0;i<n;i++)
f>>a[i]>>b[i];
int start = 0, stop = -1;
for (int i = 0; i < n; i++) {
while (start <= stop && a[i] <= a[deq[stop]]+s*(i-deq[stop]))
stop--;
deq[++stop] = i;
if (deq[start] == i-t-1)
start++;
suma += (a[deq[start]]+s*(i-deq[start]))*b[i];
}
g<<suma;
delete []b;
delete []a;
return 0;
}