Cod sursa(job #2032917)
| Utilizator | Data | 5 octombrie 2017 21:20:33 | |
|---|---|---|---|
| Problema | Carnati | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fi("carnati.in");
ofstream fo("carnati.out");
int n,i,j,pret,T[2001],P[2001],profit,s,c,maxim;
int main()
{
fi>>n>>c;
for(i=1;i<=n;i++)
fi>>T[i]>>P[i];
for(i=1;i<=n;i++)
{
pret=P[i];
s=0;
for(j=1;j<=n;j++)
{
s=max(0,s-c*(T[j]-T[j-1]));
if(pret<=P[j])
s+=pret;
maxim=max(s-c,maxim);
}
profit=max(maxim,profit);
}
fo<<profit;
fi.close();
fo.close();
return 0;
}
