Cod sursa(job #3241119)
| Utilizator | Data | 26 august 2024 18:28:09 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
#include<deque>
using namespace std;
ifstream fin ("branza.in");
ofstream fout("branza.out");
long long c[100001], q[100001];
int n, s, t, sum, i;
deque<long long>dq;
int main(){
fin>>n>>s>>t;
for(i=1;i<=n;i++){
fin>>c[i]>>q[i];
while(dq.empty()==false && c[i]<=c[dq.back()]+(i-dq.back())*s)
dq.pop_back();
dq.push_back(i);
if(i-dq.front()==t+1)
dq.pop_front();
sum+=q[i]*(c[dq.front()]+(i-dq.front())*s);
}
fout<<sum<<" ";
}
