Pagini recente » Cod sursa (job #372142) | Cod sursa (job #2519563) | Cod sursa (job #3267841) | Cod sursa (job #1919684) | Cod sursa (job #2412213)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("orase.in");
ofstream cout("orase.out");
int m,n,i,l[50005],d[50005],j,maxx,p1,p2;
void citire()
{
cin>>m>>n;
for(i=1; i<=n; i++)
cin>>l[i]>>d[i];
}
void rezolvare()
{
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
if(d[i]+d[j]+abs(l[i]-l[j])>maxx){
maxx=d[i]+d[j]+abs(l[i]-l[j]);
// p1=i;
//p2=j;
}
}
void afisare()
{
cout<<maxx/*<<' '<<p1<<' '<<p2*/;
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}