Cod sursa(job #2063830)
| Utilizator | Data | 11 noiembrie 2017 15:26:01 | |
|---|---|---|---|
| Problema | Branza | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
int d[100000], st = 0, dr = -1, v[100000];
int main() {
std::ifstream in("branza.in");
std::ofstream out("branza.out");
long long n, s, t, c;
long long r = 0;
in >> n >> s >> t;
for (int i = 0; i < n; ++i) {
in >> v[i] >> c;
if (i - d[st] > t) ++st;
while (dr >= st && v[d[dr]] + s * (i - d[dr]) >= v[i]) --dr;
d[++dr] = i;
r += c * (v[d[st]] + s * (i - d[st]));
}
out << r;
return 0;
}