Pagini recente » Cod sursa (job #2954970) | Cod sursa (job #1621680) | Cod sursa (job #1766167) | Cod sursa (job #2302931) | Cod sursa (job #2856242)
#include <iostream>
#include <deque>
#include <fstream>
#define NMAX 10000002
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
long long pmin;
deque <long long> D;
long long c[NMAX], p[NMAX];
int s, t, n;
int main()
{
f>>n>>s>>t;
for(int i=0; i<n; i++)
{
f>>c[i]>>p[i];
while(!D.empty() && c[D.back()] + (i-D.back())*s>=c[i])
D.pop_back();
while(!D.empty() && (i-D.front())>t)
D.pop_front();
D.push_back(i);
pmin=pmin+c[D.front()]*p[i]+p[i]*(i-D.front())*s;
}
g<<pmin;
return 0;
}