Pagini recente » Cod sursa (job #2776026) | Cod sursa (job #2312121) | Cod sursa (job #3152660) | Cod sursa (job #2365923) | Cod sursa (job #2063830)
#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;
}