Pagini recente » Cod sursa (job #1277083) | Cod sursa (job #2638718) | Cod sursa (job #2352553) | Cod sursa (job #2355559) | Cod sursa (job #2203663)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("heavymetal.in");
ofstream g("heavymetal.out");
struct hh{
int i,s;
};
int i,j=1,dp[100005],n;
hh v[100005];
int cmp(hh a,hh b)
{
if(a.i>b.i)
return 0;
else
return 1;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i].i>>v[i].s;
sort(v+1,v+1+n,cmp);
for(i=1;i<=v[n].s;i++)
{
dp[i]=dp[i-1];
while(v[j].s==i)
{
dp[i]=max(dp[i],dp[v[j].i]+v[j].s-v[j++].i);
}
}
g<<dp[v[n].s];
}