Pagini recente » Cod sursa (job #681657) | Cod sursa (job #1515645) | Cod sursa (job #128129) | Cod sursa (job #2019658) | Cod sursa (job #2046228)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
const int N=1000001;
pair <int,int> v[N];
int d[N];
int main()
{
int n,t,s,st,dr,i;
long long s1=0;
f>>n>>s>>t;
t++;
st=0;
dr=-1;
for (i=1; i<=n; i++)
{
f>>v[i].first;
f>>v[i].second;
if ( st <= dr && d[st] == i - t )
st++;
while ( (long long) st <= dr && v[i].first <= (long long) v[d[dr]].first + s * (i - d[dr]) )
--dr;
d[++dr]=i;
s1 += (long long) v[i].second * ( v[d[st]] .first+ s*(i-d[st]) );
}
g<<s1;
return 0;
}