Pagini recente » Cod sursa (job #2960152) | Cod sursa (job #1349439) | Cod sursa (job #2863826) | Cod sursa (job #1427451) | Cod sursa (job #195698)
Cod sursa(job #195698)
#include<fstream.h>
struct sir{int a,b,t;};
sir a[100000];
int n,max,i,j,k,l,m;
int div(int p,int q)
{int st=p,dr=q;
sir x=a[st];
while(st<dr&&x.a<=a[dr].a)dr--;
a[st]=a[dr];
while(st<dr&&x.a>=a[st].a)st++;
a[dr]=a[st];
a[st]=x;
return st;}
void quic(int p,int q)
{if(p<q)
{int k=div(p,q);
quic(p,k-1);
quic(k+1,p);
}}
int main()
{ifstream f("heavymetal.in");
ofstream g("heavymetal.out");
f>>n;
for(i=1;i<=n;i++)
{f>>a[i].a>>a[i].b;
a[i].t=a[i].b-a[i].a;
}
quic(1,n);
max=0;
for(i=2;i<=n;i++)
{max=0;
for(j=1;j<=i-1;j++)
if(a[j].b<=a[i].a&&a[j].t>max)
max=a[j].t;
a[i].t+=max;
if(a[i].t>m)
m=a[i].t;
}
g<<m;
f.close();
g.close();
return 0;
}