Pagini recente » Cod sursa (job #2362508) | Cod sursa (job #2304664) | Cod sursa (job #2382034) | Cod sursa (job #1491639) | Cod sursa (job #1584181)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
int m,n,d[50004],l[50005],maxim,poz,sol;
int main()
{
f>>m>>n;
for(int i=1; i<=n; i++)
{
f>>d[i]>>l[i];
if(d[i]+l[i]>maxim)
{
maxim=d[i]+l[i];
poz=i;
}
}
for(int i=1; i<=n; i++)
if (sol<l[poz]+l[i]+abs(d[poz]-d[i])&&i!=poz)sol=l[poz]+l[i]+abs(d[poz]-d[i]);
g<<sol;
return 0;
}