Pagini recente » Cod sursa (job #3205254) | Cod sursa (job #1987377) | Cod sursa (job #122195) | Cod sursa (job #459190) | Cod sursa (job #184682)
Cod sursa(job #184682)
#include <stdio.h>
#include <stdlib.h>
#define max(a,b)((a>b)?a:b)
#define FOR(i,s,d) for(i=(s);i<=(d);++i)
long a[100005],b[100005],n,i,j,v[1000001],ind[1000001];
int comp(const void * n1 ,const void * n2){
return b[*((long*)n1)]-b[*((long*)n2)];
}
int main ()
{
freopen("heavymetal.in","r",stdin);
freopen("heavymetal.out","w",stdout);
scanf("%ld",&n);
FOR (i,1,n){
scanf("%ld %ld",&a[i],&b[i]);
ind[i]=i;
}
qsort(ind+1,n,sizeof(long),comp);
FOR (i,1,n){
if (v[a[ind[i]]]==0)
FOR (j,1,i)
if (v[a[ind[i]]]>=v[b[ind[j]]]){
v[a[ind[i]]]=v[b[ind[j]]];
break;
}
v[b[ind[i]]]=v[b[ind[i-1]]];
FOR (j,1,i)
if(b[ind[j]]==b[ind[i]])v[b[ind[i]]]=max(v[b[ind[i]]],v[a[ind[j]]]+b[ind[j]]-a[ind[j]]);
}
printf("%ld",v[b[ind[n]]]);
//printf("\n");
//FOR (i,1,b[ind[n]])printf("%ld ",v[i]);
return 0;
}