Pagini recente » Cod sursa (job #2853927) | Cod sursa (job #1747612) | Cod sursa (job #387770) | Cod sursa (job #2582321) | Cod sursa (job #2053373)
#include <iostream>
#include <fstream>
using namespace std;
long long c[100000],p[100000],sum=0;
int n,s,t,i,st=0,dr=-1;
int main()
{
ifstream f("branza.in");
ofstream g("branza.out");
f>>n>>s>>t;
t++;
for(i=0; i<n; i++)
f>>c[i]>>p[i];
for(i=0;i<n;i++)
{
if(st<=dr && d[st]==i-t)
st++;
while(st<=dr && c[i]<=c[d[dr]+s*(i-d[dr]))
dr--;
d[++dr]=i;
sum=sum+p[i]*(long long)(c[d[st]]+s*(i-d[st]))
}
g<<sum;
return 0;
}