hdu 2600
2016-07-18 19:19
381 查看
题意:首先给一个大的区间,下面再给一些小区间,求在这些小区间外的最大值。
解析:根据小区间,把大区间划分开来,即算得最大值,(事先排个序)
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int maxn=7000009;
char s[3123];
int as[maxn];
struct node
{
int a;
int b;
} tree[maxn];
bool cmp(node x,node y)
{
if(x.a==y.a)
return x.b<y.b;
return x.a<y.a;
}
int main()
{
int t;
while(scanf("%d",&t)!=EOF)
{
int n,m;
scanf("%d%d",&n,&m);
if(n>m)
{
int temp=n;
n=m;
m=temp;
}
for(int i=1; i<=t; i++)
{
scanf("%d%d",&tree[i].a,&tree[i].b);
if(tree[i].a>tree[i].b)
{
int tmp;
tmp=tree[i].a;
tree[i].a=tree[i].b;
tree[i].b=tmp;
}
gets(s);
}
sort(tree+1,tree+t+1,cmp);
int ia=0;
int ib=0;
ia=tree[1].a;
ib=tree[1].b;
int ans=ia-1;
for(int i=2; i<=t; i++)
{
if(ib+1>=tree[i].a)
ib=tree[i].b;
else
{
ia=tree[i].a;//左区间
ib=tree[i].b;//右区间
ans=ia-1;//区间值
}
//printf("%d %d %d\n",ia,ib,ans);
}
if(ib<m)
ans=m;
if(ans<n)
printf("Badly!\n");
else
printf("%d\n",ans);
}
return 0;
}
解析:根据小区间,把大区间划分开来,即算得最大值,(事先排个序)
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int maxn=7000009;
char s[3123];
int as[maxn];
struct node
{
int a;
int b;
} tree[maxn];
bool cmp(node x,node y)
{
if(x.a==y.a)
return x.b<y.b;
return x.a<y.a;
}
int main()
{
int t;
while(scanf("%d",&t)!=EOF)
{
int n,m;
scanf("%d%d",&n,&m);
if(n>m)
{
int temp=n;
n=m;
m=temp;
}
for(int i=1; i<=t; i++)
{
scanf("%d%d",&tree[i].a,&tree[i].b);
if(tree[i].a>tree[i].b)
{
int tmp;
tmp=tree[i].a;
tree[i].a=tree[i].b;
tree[i].b=tmp;
}
gets(s);
}
sort(tree+1,tree+t+1,cmp);
int ia=0;
int ib=0;
ia=tree[1].a;
ib=tree[1].b;
int ans=ia-1;
for(int i=2; i<=t; i++)
{
if(ib+1>=tree[i].a)
ib=tree[i].b;
else
{
ia=tree[i].a;//左区间
ib=tree[i].b;//右区间
ans=ia-1;//区间值
}
//printf("%d %d %d\n",ia,ib,ans);
}
if(ib<m)
ans=m;
if(ans<n)
printf("Badly!\n");
else
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- 【HDU 5366】The mook jong 详解
- 【HDU 2136】Largest prime factor 详细图解
- 【HDU 1568】Fibonacci 数学公式 详解
- HDU 1568
- HDU1290
- HDU1568(Fobonacci公式)
- HDU ACM Step 2.2.2 Joseph(约瑟夫环问题)
- HDU 1405
- HDU 1297
- hdu 1205
- hdu 2087
- hdu 1016
- HDU 4898 The Revenge of the Princess’ Knight ( 2014 Multi-University Training Contest 4 )
- HDU 5592 ZYB's Premutation 线段树(查找动态区间第K大)
- HDU 5240 Exam (好水的题)
- HDU5237 Base64 大模拟
- HDU 1000
- HDU 1001
- HDU 1016 Prime Ring Problem
- HDU 1017 A Mathematical Curiosity