Cod sursa(job #1445479)
| Utilizator | Data | 30 mai 2015 14:07:18 | |
|---|---|---|---|
| Problema | Orase | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
struct o
{
int d, l;
}a[50001];
int n, m, i, Max = -2147000000;
int main()
{
f >> m >> n;
for (i = 1; i <= n; i++)
f >> a[i].d >> a[i].l;
for (i = 1; i <= n; i++)
for (int j = i+1; j <= n; j++)
if (a[i].l+a[j].l + abs(a[i].d-a[j].d) > Max)
Max = a[i].l+a[j].l + abs(a[i].d-a[j].d);
g << Max;
return 0;
}
