Pagini recente » Cod sursa (job #2019543) | Cod sursa (job #1727554) | Diferente pentru problema/nowhere-zero intre reviziile 17 si 8 | Diferente pentru problema/puncte intre reviziile 7 si 1 | Cod sursa (job #3305352)
#include <bits/stdc++.h>
#define MAXN 50000
using namespace std;
pair < int , int > oras[MAXN];
int maxd , maxdist;
int dist ( pair < int , int > i , pair < int , int > maxd ) {
return i.second + abs ( maxd.first - i.first ) + maxd.second;
}
int main () {
ifstream cin ( "orase.in" );
ofstream cout ( "orase.out" );
int m , n , i , d , l;
cin >> m >> n;
for ( i = 0; i < n; i++ ) {
cin >> d >> l;
oras[i] = { d , l };
}
sort ( oras , oras + n );
for ( i = 1; i < n; i++ ) {
maxdist = max ( maxdist , dist ( oras[i] , oras[maxd] ) );
if ( oras[i].second > oras[maxd].second + ( oras[i].first - oras[maxd].first ) )
maxd = i;
}
cout << maxdist << '\n';
}