Cod sursa(job #2364429)
Utilizator | Data | 4 martie 2019 08:30:32 | |
---|---|---|---|
Problema | Orase | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
long long n,m,s,smax,d[10001],l[10001],i,j;
int main()
{
f>>m>>n;
for(i=1;i<=n;i++)
f>>d[i]>>l[i];
for(i=1;i<=n-1;i++)
{ for(j=i+1;j<=n;j++)
s=fabs(d[i]-d[j])+l[i]+l[j];
if(s>smax)
smax=s;
s=0;
}
g<<smax;
return 0;
}