Cod sursa(job #3186334)
| Utilizator | Data | 22 decembrie 2023 18:48:40 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
deque < pair <int, int> > dq;
int main()
{
int n,t,s,i,p,c;
long long sum = 0;
fin >> n >> s >> t;
for(i = 1; i <= n; i++){
fin >> p >> c;
while(!dq.empty() && dq.front().second < i - t) dq.pop_front();
while(!dq.empty() && dq.back().first > p - i * s) dq.pop_back();
dq.push_back({p - i * s, i});
sum += c * (i * s + dq.front().first);
}
fout << sum;
return 0;
}
