Cod sursa(job #3239772)
| Utilizator | Data | 7 august 2024 15:46:08 | |
|---|---|---|---|
| Problema | Branza | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("branza.in");
ofstream cout("branza.out");
int n,s,t;
long long cost[100005],sol;
deque<int>d;
int main()
{
cin>>n>>s>>t;
d.push_back(1);
for(int i=1;i<=n;i++)
{
int cantitate;
cin>>cost[i]>>cantitate;
while(!d.empty() && cost[i]-i*s<cost[d.back()]-d.back()*s)
d.pop_back();
d.push_back(i);
sol+=cantitate*((i-d.front()*s)+cost[d.front()]);
if(i-d.front()==t)
d.pop_front();
}
cout<<sol;
return 0;
}
