Pagini recente » Cod sursa (job #2222080) | Cod sursa (job #2308196) | Cod sursa (job #678698) | Monitorul de evaluare | Cod sursa (job #2071513)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
const int N=5000001;
int c[N],p[N],dmin[N],dmax[N],stmax,stmin,drmin=-1,drmax=-1,n,t,s,i;
int main ()
{
int st=0;
f>>n>>s>>t;
for (i=1; i<=n; i++)
f>>c[i]>>p[i];
for (i=1; i<=n; i++){
while (stmin<=drmin && c[i]<=c[dmin[drmin]]+s*(i-dmin[drmin])){
drmin--;
}
dmin[++drmin]=i;
st+=(c[dmin[stmin]]+s*(i-dmin[stmin]))*p[i];
}
g<<st;
return 0;
}