Cod sursa(job #2118228)
| Utilizator | Data | 30 ianuarie 2018 13:19:15 | |
|---|---|---|---|
| Problema | Orase | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
std::ifstream in("orase.in");
std::ofstream out("orase.out");
using namespace std;
//bool viz[50001];
vector<int>where;
int v[1000001];
int main()
{
int n , m ;
in >> n >>m ;
for(int i =1 ; i<= m ; ++i)
{
int x, y;
in >> x >> y;
if(!v[x]) {where.push_back(x);v[x]=y;}
else {v[x]=max(v[x],y);}
}
sort(where.begin(),where.end());
int t = 0;
int dim = where.size();
for(int i =0 ; i < dim-1 ; ++i)
t = max(t,where[i+1]-where[i]+v[where[i]]+v[where[i+1]]);
out << t ;
return 0;
}
