Cod sursa(job #3225611)
Utilizator | Simzianu Teodora teosim | Data | 18 aprilie 2024 10:10:05 |
---|---|---|---|
Problema | Carnati | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("carnati.in");
ofstream out("carnati.out");
int t[2001],p[2001];
int main()
{
int n,c;
in>>n>>c;
int i,j;
for(i=1;i<=n;i++)
{
in>>t[i]>>p[i];
}
int pf,s,smax=-1;
for(i=1;i<=n;i++)
{
pf=p[i]; //pretul fixat
s=0;
for(j=1;j<=n;j++)
{
if(pf<=p[j])
{
if(s<0)
s=0;
s=s+pf;
if(s>smax)
smax=s;
s=s-c;
}
s=s-c*(t[j+1]-t[j]);
}
}
smax+=c;
out<<smax;
return 0;
}