Cod sursa(job #2055359)
| Utilizator | Data | 3 noiembrie 2017 09:28:25 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int c[1000000],d[10000];
int main()
{
int n,s,t,st=0,dr=-1,x;
long long q=0;
fin>>n>>s>>t;
for(int i=0;i<n;i++){
fin>>c[i]>>x;
if(st<=dr&&d[st]<=i-t){
st++;
}
while(st<=dr&&c[i]<=c[d[dr]]+s*(i-d[dr])){
dr--;
}
d[++dr]=i;
q+=(c[d[st]]+s*(i-d[st]))*x;
}
fout<<q;
return 0;
}
