Cod sursa(job #2616408)
Utilizator | Nanu Robert-Ionut robertnanu_fmi | Data | 18 mai 2020 13:55:05 |
---|---|---|---|
Problema | Branza | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
long long c[100001],p[100001],n,s,k,st=0,dr=-1,nanu[100001],rez=0;
int main(){
f>>n>>s>>k;
k++;
for(int i=0; i<n; i++)
f>>c[i]>>p[i];
for(int i=0; i<n; i++){
if(st<=dr && nanu[st]==(i-k)){
st++;
}
while(st<=dr && c[i]<=c[nanu[dr]]+(i-nanu[dr])*s){
dr--;
}
nanu[++dr]=i;
rez=rez+(c[nanu[st]]+(i-nanu[st])*s)*p[i];
}
g<<rez;
return 0;
}