Pagini recente » Cod sursa (job #1595410) | Cod sursa (job #1339115) | Cod sursa (job #2828577) | Cod sursa (job #198061) | Cod sursa (job #1752726)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
long long d[1000001];
int main()
{
long long m,n,i,x,y,first=999999999,maxx=0,s;
fin>>m>>n;
for(i=1;i<=n;i++)
{
fin>>x>>y;
d[x]=max(d[x],y);
if(x<first)
first=x;
}
s=d[first];
for(i=first;i<=m;i++)
{
if(d[i]==0)s++;
else
{
if(s+d[i]+1>maxx)maxx=s+d[i]+1;
if(s<d[i])s=d[i];
}
}
fout<<maxx;
return 0;
}