Pagini recente » Cod sursa (job #521929) | Cod sursa (job #2821217) | Cod sursa (job #1498227) | Cod sursa (job #2224823) | Cod sursa (job #2886726)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
deque <int> d;
int n, s, t, v[10000000], p, suma=0;
int main()
{
f>>n>>s>>t;
for(int i=0; i<n; i++)
{
f>>v[i]>>p;
while(!d.empty() && d.front()<i-t-1)
d.pop_front();
while(!d.empty() && v[i]<v[d.back()]+(i-d.back())*s)
d.pop_back();
d.push_back(i);
suma=suma+p*(v[d.front()]+(i-d.front())*s);
}
g<<suma;
f.close();
g.close();
return 0;
}