HDU1025

最新推荐文章于 2024-09-20 15:09:03 发布

Keep_Trying_Go

最新推荐文章于 2024-09-20 15:09:03 发布

阅读量61

点赞数 1

分类专栏：最长上升子序列文章标签：算法动态规划

本文链接：https://blog.csdn.net/Keep_Trying_Go/article/details/114474596

版权

最长上升子序列专栏收录该内容

7 篇文章 0 订阅

订阅专栏

最长上升子序列：

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxx=500005;
int a[maxx],p[maxx];
int n;
int len;
int find(int x){
	int left=1,right=len;
	int mid;
	while(left<=right){
		mid=(left+right)>>1;
		if(x>p[mid]){
			left=mid+1;
		}else{
			right=mid-1;
		}
	}
	return left;
}
int main(){
	int count=1;
	while(cin>>n){
		memset(a,0,sizeof(a));
		memset(p,0,sizeof(p));
		for(int i=0;i<n;i++){
			int ax,b;
			cin>>ax>>b;
			a[ax]=b;
		}
		p[1]=a[1];
		len=1;
		for(int i=2;i<=n;i++){
			if(a[i]>p[len]){
				p[++len]=a[i];
			}else{
				int j=find(a[i]);
				p[j]=a[i];
			}
		}
		cout<<"Case "<<count++<<":"<<endl;
		if(len==1){
			cout<<"My king, at most "<<len<<" road can be built."<<endl;
		}else{
			cout<<"My king, at most "<<len<<" roads can be built."<<endl;
		}
		cout<<endl;
	}
	return 0;
}