Cod sursa(job #2927574)
Utilizator | Gabriel Stefan Tita gabriel.9619 | Data | 20 octombrie 2022 21:17:52 |
---|---|---|---|
Problema | Carnati | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream fin("carnati.in");
ofstream fout("carnati.out");
int v[2001], t[2001];
int main()
{
int n, k, i, s=0, smax=0, poz=1, pret, j;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>t[i]>>v[i];
}
for(i=1;i<=n;i++)
{
s=-1;
int pret=v[i];
for(j=1;j<=n;j++)
{
if(v[j]>=pret)
{
if(s>=0)
{
s=s+pret-(t[j]-poz)*k;
poz=t[j];
}
else
{
poz=t[j];
s=pret-k;
}
if(s>smax)
{
smax=s;
}
}
}
}
fout<<smax;
}