Cod sursa(job #2940094)
| Utilizator | Data | 14 noiembrie 2022 20:33:36 | |
|---|---|---|---|
| Problema | Branza | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | cnilc1_2-dq | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
long long n, s, t, c[1000002], kg[1000002], i, r;
deque<long long> q;
int main() {
fin >> n >> s >> t;
for(i = 1; i <= n; i++) fin >> c[i] >> kg[i];
for(i = 1; i <= n; i++) {
while(!q.empty() && c[i] <= c[q.back()] + s * (i - q.back())) q.pop_back();
q.push_back(i);
if(i > t + q.front()) q.pop_front();
r += kg[i] * s * (i - q.front()) + kg[i] * c[q.front()];
}
fout << r;
return 0;
}
