Cod sursa(job #1584181)
| Utilizator | Data | 29 ianuarie 2016 19:24:20 | |
|---|---|---|---|
| Problema | Orase | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#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;
}
