Pagini recente » Cod sursa (job #603681) | Cod sursa (job #567169) | Cod sursa (job #2676628) | Cod sursa (job #534986) | Cod sursa (job #1258908)
#include <stdio.h>
long abs(long n)
{
if(n<0) return -n;
return n;
}
int n,t[2001];
long c[2001],p,old,maxs,news;
int main()
{
FILE*f =fopen("carnati.in","r");
fscanf(f,"%d%d",&n,&p);
for(int i = 0 ;i<n;i++)
fscanf(f,"%d%d",&t[i],&c[i]);
fclose(f);
for(int i = 0 ;i<n;i++)
{
old = news = 0;
for(int j = 0 ;j<n;j++)
{
if(c[j]>=c[i])
news = old -(abs(t[j]-t[i]))*p+c[i];
if(news >= maxs) maxs = news;
old = news;
}
}
FILE * g = fopen("carnati.out","w");
fprintf(g,"%d",maxs-p);
fclose(g);
return 0;
}