Pagini recente » Cod sursa (job #1810541) | Cod sursa (job #3124972) | Cod sursa (job #3170039) | Cod sursa (job #883167) | Cod sursa (job #2213100)
#include <fstream>
using namespace std;
ifstream in ("branza.in");
ofstream out ("branza.out");
long long d[100003],v[100003];
int main()
{
long long n,s,t,i,st=0,dr=-1,sm=0,p;
in>>n>>s>>t;
for(i=1;i<=n;++i)
{
in>>v[i]>>p;
if(d[st]==i-t-1 && i-t-1!=0)
++st;
while(st<=dr && v[i]<=v[d[dr]]+(i-d[dr])*s)
--dr;
d[++dr]=i;
sm+=p*(v[d[st]]+(i-d[st])*s);
}
out<<sm;
return 0;
}
/*
not Andreescu xD
*/