Pagini recente » Cod sursa (job #1043449) | Cod sursa (job #2970825) | Cod sursa (job #3237808) | Cod sursa (job #247767) | Cod sursa (job #206083)
Cod sursa(job #206083)
#include <stdio.h>
#define NMAX 50000
long int n,m;
long int D[NMAX],L[NMAX];
void quicksort(int li, int ls)
{
int i,j,mij,aux;
i=li;
j=ls;
mij=D[(li+ls)/2];
do
{
while (D[i]<mij) ++i;
while (D[j]>mij) --j;
if (i<=j)
{
aux=D[i];
D[i]=D[j];
D[j]=aux;
aux=L[i];
L[i]=L[j];
L[j]=aux;
++i;
--j;
}
}
while (i<=j);
if (li<j) quicksort(li,j);
if (i<ls) quicksort(i,ls);
}
int main()
{
freopen("orase.in","rt",stdin);
scanf("%ld %ld", &m, &n);
long int i,j;
for (i=1;i<=n;i++)
scanf("%ld %ld", &D[i], &L[i]);
quicksort(1,n);
long int maxim=0,q;
j=1;
while (j<=n)
{
i=j+1;
while (i<=n)
{
q=D[i]+L[i]+L[j]-D[j];
if (maxim<q)
maxim=q;
++i;
}
++j;
}
freopen("orase.out","wt",stdout);
printf("%ld\n",maxim);
return 0;
}