Cod sursa(job #3375993)
| Utilizator | Data | 14 noiembrie 2026 21:44:26 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int n , t , s , c[100001] , p[100001];
long long rez;
deque<int> dq;
int main(){
fin >> n >> s >> t;
for(int i = 1 ; i <= n ; i++) fin >> c[i] >> p[i];
for(int i = 1 ; i <= n ; i++){
while(!dq.empty() && c[dq.back()] - dq.back() * s >= c[i] - i * s) dq.pop_back();
if(dq.front() < i - t) dq.pop_front();
dq.push_back(i);
rez += (c[dq.front()] + (i - dq.front()) * s) * p[i];
}
fout << rez;
}
