Cod sursa(job #963344)

Utilizator teoionescuIonescu Teodor teoionescu Data 17 iunie 2013 11:24:06
Problema Branza Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.73 kb
#include<fstream>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
const int N = 100005;
int v[N],p[N],n,s,t,dq[N],st=1,dr,r;
void noapte(){
    int i;
    for(i=st;i<=dr;i++) v[dq[i]]+=s;
}
void stanga(int i){
    if(dq[st]==i-t-1) st++;
}
void dreapta(int i){
    while(dr>=st && v[i]<=(v[dq[dr]])+(i-dq[dr])*s) dr--;
}
int main(){
    int i;
    in>>n>>s>>t;
    for(i=1;i<=n;i++) in>>v[i]>>p[i];
    for(i=1;i<=n;i++){
        if(i>=t) stanga(i);
        //noapte();
        dreapta(i);
        dq[++dr]=i;
        //for(int j=st;j<=dr;j++) out<<v[dq[j]]<<' '; out<<'\n';
        //out<<(v[dq[st]])<<' ';
        r+=(v[dq[st]]+(i-dq[st])*s)*p[i];
    }
    out<<r;
    return 0;
}