Pagini recente » Cod sursa (job #997839) | Cod sursa (job #3215312) | Cod sursa (job #1758635) | Cod sursa (job #3230006) | Cod sursa (job #908761)
Cod sursa(job #908761)
#include<fstream>
#include<algorithm>
#define NMAX 100005
#define end first
#define begin second
using namespace std;
pair<int,int> v[NMAX];
int DP[NMAX],n;
void read()
{
ifstream fin("heavymetal.in");
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i].begin>>v[i].end;
fin.close();
}
void print()
{
ofstream fout("heavymetal.out");
fout<<DP[n];
fout.close();
}
int binar(int s,int d,int val)
{
if(s<=d)
{
int m=(s+d)/2;
if(v[m].end==val)
{
while(v[m+1].end==val)
m++;
return m;
}
if(v[m].end<val && v[m+1].end>val)
return m;
if(v[m].end>val && v[m-1].end<val)
return m-1;
if(v[m].end>val)
return binar(s,m-1,val);
return binar(m+1,d,val);
}
return 0;
}
int main()
{
read();
int poz;
sort(v+1,v+n+1);
DP[1]=v[1].end-v[1].begin;
for(int i=2;i<=n;i++)
{
poz=binar(1,i-1,v[i].begin);
DP[i]=max(DP[i-1],DP[poz]+(v[i].end-v[i].begin));
}
print();
return 0;
}