Pagini recente » Cod sursa (job #1392713) | Cod sursa (job #78817) | Cod sursa (job #1562651) | Cod sursa (job #1427668) | Cod sursa (job #2054198)
#include <iostream>
#include<fstream>
using namespace std;
int p[100000],d[100000],c[100000];
int main()
{
int n,s,t,ni,pi,i,st=0,dr=-1;
long long rez = 0;
ifstream f("branza.in");
ofstream o("branza.out");
f>>n>>s>>t;
for(i=0; i<n; i++)
{
f>>c[i]>>p[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;
rez += p[i] * (c[d[st]] + (long long)s*(i-d[st]));
}
o << rez;
return 0;
}