Pagini recente » Clasamentul arhivei educationale | Cod sursa (job #2122410) | Borderou de evaluare (job #1772016) | Borderou de evaluare (job #2015637) | Cod sursa (job #2306187)
#include <bits/stdc++.h>
const int MV(1e5 + 5) ;
int v[MV], dq[MV], ans ;
int main() {
freopen("branza.in", "r", stdin) ;
freopen("branza.out", "w", stdout) ;
int n, s, t, p ;
scanf("%d %d %d", &n, &s, &t) ;
register int i ;
int st(0), dr(-1) ;
for (i = 1 ; i <= n ; ++ i) {
scanf("%d %d", v + i, &p) ;
if (dq[st] == i - t - 1) {
st ++ ; }
while (st <= dr && v[i] <= v[dq[dr]] + (i - dq[dr]) * s) {
dr -- ; }
dq[++ dr] = i ;
ans += p * (v[dq[st]] + (i - dq[st]) * s) ; }
printf("%d", ans) ;
return 0 ; }