Pagini recente » Cod sursa (job #2522615) | Cod sursa (job #2533608) | Cod sursa (job #3209453) | Cod sursa (job #575607) | Cod sursa (job #2888214)
#include <iostream>
#include <fstream>
#include <deque>
#include <utility>
using namespace std;
int main() {
ifstream f("branza.in");
ofstream g("branza.out");
int n,s,timp,pret,cant;
long long total=0;
deque<pair<int,int>> br;
f>>n>>s>>timp;
for(int i=0;i<n;++i){
f>>pret>>cant;
while(!br.empty() && pret<br.back().first+s*(i-br.back().second))
br.pop_back();
br.push_back(make_pair(pret,i));
if(br.front().second<i-timp)
br.pop_front();
total += cant*(br.front().first+s*(i-br.front().second));
}
g<<total;
return 0;
}