Pagini recente » Cod sursa (job #1934310) | Cod sursa (job #2349719) | Cod sursa (job #1895521) | Cod sursa (job #1779133) | Cod sursa (job #2927737)
#include <fstream>
#include <climits>
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=INT_MIN, 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;
}