Pagini recente » Cod sursa (job #2695516) | Cod sursa (job #237459) | Cod sursa (job #3235113) | Cod sursa (job #765183) | Cod sursa (job #2397389)
#include <bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define maxn 100000
using namespace std;
pii v[maxn+5];
pii dp[maxn+5]; ///dp[i]-timp maxim cu bandele 0..i (fi) capat dreapta (se)
bool cmp ( pii a, pii b )
{
if ( a.fi != b.fi ) return a.fi < b.fi;
return a.se > b.se;
}
int main ()
{
ifstream fin ( "heavymetal.in" );
ofstream fout ( "heavymetal.out" );
int n; fin >> n;
int i, j, z, itv, _M = 0;
for ( i = 0; i < n; i++ ) fin >> v[i].fi >> v[i].se;
sort ( v, v + n, cmp );
for ( i = 0; i < n; i++ )
{
itv = v[i].se-v[i].fi;
dp[i] = {itv,v[i].se};
for ( j = 1; j <= i; j++ )
if ( dp[i-j].se <= v[i].fi && dp[i].fi < dp[i-j].fi + itv ) dp[i] = {dp[i-j].fi + itv,v[i].se};
_M = max(_M, dp[i].fi);
}
fout << _M;
fin.close ();
fout.close ();
return 0;
}