Cod sursa(job #2730911)
| Utilizator | Data | 26 martie 2021 23:55:48 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <deque>
#define x 100000
using namespace std;
int main()
{
ifstream fis;
fis.open("branza.in");
ofstream gis;
gis.open("branza.out");
int n,s,t;
fis>>n>>s>>t;
deque <int> q;
int sum=0;
int v[x];
for(int i=0;i<n;i++)
{
int cost;
fis>>v[i]>>cost;
if(!q.empty() && i-t-1==q.front())
q.pop_front();
while(!q.empty() && v[i]<=(v[q.back()]+s*(i-q.back())))
q.pop_back();
q.push_back(i);
sum += cost*(v[q.front()]+(i-q.front()) * s);
}
gis<<sum;
return 0;
}
