Pagini recente » Cod sursa (job #860267) | Cod sursa (job #1088353) | Cod sursa (job #2638423) | Cod sursa (job #2885632) | Cod sursa (job #905628)
Cod sursa(job #905628)
#include<cstdio>
#include<deque>
using namespace std;
deque<int>d;long long v1[100005],v2[100005];
int main()
{
freopen("branza.in","r",stdin);freopen("branza.out","w",stdout);
long long pr=0,n,s,t,i;
scanf("%lld%lld%lld",&n,&s,&t);
for(i=1;i<=n;++i)
{
scanf("%lld%lld",&v1[i],&v2[i]);
while(!d.empty()&&(i-d.back())*s>v1[i]-v1[d.back()])
d.pop_back();
d.push_back(i);
if(i-t>=d.front())
d.pop_front();
pr+=v2[i]*v1[d.front()]+(i-d.front())*v2[i]*s;
}
printf("%lld",pr);
}