2021/4/17总结

2021/4/17总结

第一题：最长不下降子序列

思路：

为了保证结果最优，采纳动态规划从后向前依次扫描，遇到一个比该数x1小的数x2就令num[x2] = max(num[x2],num[x1]+1)

代码：

#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
	int number;
	int to;
}line[10001];
int num[10001] = { };
int answer[10001] = { };
int cnt = 0;
int _max = 0;
int _max_number;
void print(int n){
	if(line[n].to != 0)printf("%d ",line[n].to);
}
int main(){
	int n = 0;
	while(scanf("%d",&line[++n].number) != EOF);
	for(int i = 1 ; i <= n ; i++){
		num[i] = 1; 
		line[i].to = 0;
	}
	for(int i = n ; i >= 1 ; i--){
		for(int j = i ; j >= 1 ; j--){
			if(line[j].number < line[i].number){
				num[j] = max(num[j],num[i]+1);
				line[i].to = line[j].number;
			}
			_max = max(num[j],num[i]);
		}
	}
	int zz = _max_number;
	for(int i = 1 ; i <= n ; i++){
		if(num[i] == _max){
			_max_number = i;
			break;
		}
	}
	printf("max=%d\n",_max);
	zz = num[_max_number];
	for(int i = _max_number ; i <= n ; i++){
		if(num[i] == zz-1){
			zz = num[i];
			cnt ++;
			answer[cnt] = line[i].number;
		}
	}
	answer[0] = line[_max_number].number;
	for(int i = 0 ; i <= cnt ; i++)printf("%d ",answer[i]);
	return 0;
}
//SPJ在哪里！ 

第二题：导弹拦截

思路：

采用两个序列分别处理最长下降子序列和最大导弹系统数，采用STL中的upper_bound和lower_bound // greater()代表从大到小排序

代码：

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int a[101000],line_1[101000],line_2[101000];
int length_1 = 1,length_2 = 1;
int n;
int main(){
	while(scanf("%d",&a[++n]) != EOF);
	n--;
	line_1[1] = a[1];
	line_2[1] = a[1];
	for(int i = 2 ; i <= n ; i++){
		if(line_1[length_1] >= a[i])line_1[++length_1] = a[i];
		else{
			int spl_1 = upper_bound(line_1+1,line_1+1+length_1,a[i],greater<int>())-line_1; 
			line_1[spl_1] = a[i]; 
		}
		if (line_2[length_2] < a[i]) line_2[++length_2] = a[i];		
		else {
			int spl_2 = lower_bound(line_2+1,line_2+1+length_2,a[i])-line_2;
			line_2[spl_2] = a[i];
		}
	}
	printf("%d\n%d",length_1,length_2);
	return 0;
}

百年不写博客之人~~~