Cod sursa(job #1142276)
| Utilizator | Data | 13 martie 2014 17:52:01 | |
|---|---|---|---|
| Problema | Orase | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("orase.in");
ofstream g("orase.out");
int m,n;
struct {int d,l;} o[50001];
int main()
{
int i,max=-1,j;
f>>n>>m;
for(i=1;i<=m;i++)
f>>o[i].d>>o[i].l;
for(i=1;i<m;i++)
for(j=i+1;j<=m;j++)
if(o[i].d>o[j].d){
if(o[i].d-o[j].d+o[i].l+o[j].l>max)
max=o[i].d-o[j].d+o[i].l+o[j].l;
}
else
if(o[j].d-o[i].d+o[i].l+o[j].l>max)
max=o[j].d-o[i].d+o[i].l+o[j].l;
g<<max<<"\n";
return 0;
}
