Pagini recente » Cod sursa (job #1305073) | Cod sursa (job #2164405) | Cod sursa (job #2660135) | Cod sursa (job #2217635) | Cod sursa (job #2320849)
#include <fstream>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
int main(){
long long c[100001], p[100001], n, s, t, st=0, dr=-1, dq[100001], rez=0;
in>>n>>s>>t;
t++;
for(int i=0; i<n; i++){
in>>c[i]>>p[i];
}
for(int i=0; i<n; i++){
if(st<=dr && dq[st]==(i-t)){
st++;
}
while(st<=dr && c[i]<=c[dq[dr]]+(i-dq[dr])*s){
dr--;
}
dq[++dr]=i;
rez=rez+(c[dq[st]]+(i-dq[st])*s)*p[i];
}
out<<rez;
return 0;
}