Pagini recente » Cod sursa (job #2468464) | Cod sursa (job #1640385) | Istoria paginii utilizator/neludoros | Cod sursa (job #355239) | Cod sursa (job #1773789)
#include <stdio.h>
#include <stdlib.h>
int orase[1000000][2];
int main() {
FILE *fin, *fout;
int m, n, i, d, l, max, dist, j;
fin = fopen( "orase.in", "r" );
fout = fopen( "orase.out", "w" );
fscanf( fin, "%d%d", &m, &n );
for ( i = 0; i < n; i++ ) {
fscanf( fin, "%d%d", &d, &l );
if ( orase[d][0] == 0 )
orase[d][0] = l;
else
orase[d][1] = l;
}
max = 0;
for ( i = 0; i <= m; i++ ) {
for ( j = i; j <= m; j++ ) {
if ( orase[i][0] != 0 && orase[j][1] != 0 ) {
dist = orase[i][0] + orase[j][1] + ( j - i );
if ( max < dist )
max = dist;
}
if ( orase[j][0] != 0 && orase[i][1] != 0 ) {
dist = orase[j][0] + orase[i][1] + ( j - i );
if ( max < dist )
max = dist;
}
}
}
fprintf( fout, "%d", max );
fclose( fin );
fclose( fout );
return 0;
}