Cod sursa(job #956631)
| Utilizator | Data | 3 iunie 2013 15:51:35 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
int q[100001][2],v[100001][2];
int main()
{
int n,s,t,z=1,i,a=1,b=0;
long long bani = 0;
f>>n>>s>>t;
for(i=1;i<=n;i++)
f>>v[i][0]>>v[i][1];
for(i=1;i<=n;i++)
{
if(z-q[a][1]>t)
a++;
while(a<=b && v[i][0]<=q[b][0]+(z-q[b][1])*s)
b--;
b++;
//g<<v[i][0]<<' ';
q[b][0]=v[i][0];
q[b][1]=z;
bani+=(q[a][0]+(z-q[a][1])*s)*v[i][1];
//g<<q[a][0]<<' '<<q[a][1]<<' '<<bani<<endl;
z++;
}
g<<bani;
}
