Cod sursa(job #2053270)
Utilizator | Data | 31 octombrie 2017 17:34:55 | |
---|---|---|---|
Problema | Branza | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <deque>
using namespace std;
deque<int>v;
int main()
{
int n,s,t,i;
long long c[100000],p[100000],sum=0;
std::deque<int>::iterator it=v.end();
cin>>n>>s>>t;
for(i=0; i<n; i++)
cin>>c[i]>>p[i];
for(i=0; i<n; i++)
{
it=v.begin();
if(*it-i==0)v.pop_front();
while(!v.empty() && c[i]<c[*it]+s*(i-*it))
{
v.pop_back();
it=v.end();
}
v.push_back(i);
it=v.begin();
sum=sum+p[i]*(c[*it]+s*(i-*it));
}
cout<<sum;
return 0;
}