Pagini recente » Cod sursa (job #1020828) | Cod sursa (job #3153629) | Cod sursa (job #2321518) | Cod sursa (job #2370958) | Cod sursa (job #291098)
Cod sursa(job #291098)
#include<fstream.h>
ifstream in("carnati.in");
ofstream out("carnati.out");
int n;
long long int c,v,sal,profmax;
struct cump
{ long long int t;
long long int cost;
};
cump x[2000];
void vanzari(int i,int j,int k)
{ int p;
v=0;
for(p=i;p<=j;p++)
if(x[p].cost>=x[k].cost)v=v+x[k].cost;
}
int main()
{ int i,j,k;
long long int timp;
in>>n>>c;
for(i=1;i<=n;i++)
in>>x[i].t>>x[i].cost;
in.close();
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{ timp=x[j].t-x[i].t+1;
sal=timp*c;
for(k=i;k<=j;k++)
{ vanzari(i,j,k);
if((v-sal)>profmax)
profmax=v-sal;
}
}
out<<profmax;
out.close();
return 0;
}