LIS&LCS 线性结构dp

LIS 最长不下降子序列。递推式：dp[i]=max(dp[j])+1;(j<i&&a[j]<=a[i] dp[i]表示以i为结尾的最长不下降子序列的长度)

hdu1160 题目是说老鼠的速度与其体重成反比，所以需要你输出一堆老鼠，它们的速度递减但是体重递增。

思路：首先对速度从大到小排序，接着对排序后的数组的体重求lis,路径输出需要熟练。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int maxn=1e3+50;
int weight,speed,n,dp[maxn],fa[maxn],maxs,max_loc;

struct mouse{
	int weight,speed,id,front;
}m[maxn];

bool cmp(mouse a,mouse b){
	if(a.speed==b.speed)
	return a.weight<b.weight;
	return a.speed>b.speed;
}

int main(){
	n=0;
	while(scanf("%d%d",&weight,&speed)!=EOF){
		//if(!weight&&!speed) break;
		m[++n].weight=weight;
		m[n].speed=speed;
		m[n].id=n;
	}
	sort(m+1,m+n+1,cmp);
	dp[1]=1;
	for(int i=1;i<=n;i++){
		maxs=0;
		for(int j=1;j<i;j++){
			if(m[j].weight<m[i].weight&&maxs<dp[j]){
				maxs=max(maxs,dp[j]);
				m[i].front=j;
			}
		}
		dp[i]=maxs+1;
	}
	maxs=0;
	for(int i=1;i<=n;i++){
		if(maxs<dp[i]){
			maxs=dp[i];
			max_loc=i;
		}
	}
	int u=max_loc;
	//cout<<"test:"<<dp[4]<<endl;
	stack<mouse> s;
	for(;;){
		s.push(m[u]);
		if(!m[u].front) break;
		u=m[u].front;
	}
	printf("%d\n",s.size());
	while(!s.empty()){
		mouse temp=s.top();
		s.pop();
		printf("%d\n",temp.id);
	}	
}

LCS:最长公共子序列。大体思路:设dp[i][j]为a序列的1-i位与b序列1-j位的最长公共子序列则。如果a[i]==b[j],dp[i][j]=dp[i-1][j-1]+1.否则:dp[i][j]=max(dp[i-1][j],dp[i][j-1])

51nod 1006

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string> 
#include<iostream>
using namespace std;
const int maxn=1e3+50;
char a[maxn],b[maxn],s[maxn];
int dp[maxn][maxn];
int main(){
	while(cin>>a+1>>b+1){
		//cout<<"test"<<strlen(a+1)<<endl; 
		memset(dp,0,sizeof(dp)); 
		memset(s,0,sizeof(s));
		for(int i=1;i<=strlen(a+1);i++){
			for(int j=1;j<=strlen(b+1);j++){
				if(a[i]==b[j])
				dp[i][j]=dp[i-1][j-1]+1;
				else 
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
			}
		}
			int k=0;
			int a_length=strlen(a+1);
			int b_length=strlen(b+1);
			//cout<<"test:"<<dp[a_length][b_length]<<endl;
			while(dp[a_length][b_length]){
				if(dp[a_length][b_length]==dp[a_length-1][b_length])
					a_length--;
				else if(dp[a_length][b_length]==dp[a_length][b_length-1])
					b_length--;
				else if(dp[a_length][b_length]!=dp[a_length-1][b_length-1]){
					s[k++]=a[a_length];
					a_length--;
					b_length--;
				}
			}
			for(int i=strlen(s)-1;i>=0;i--)
			cout<<s[i];
			cout<<endl;
		}
	return 0;
} 

zoj1027：给出两个基因序列，计算二者最大的相似值。

思路：这道题是lcs思路的一个巧妙运用，因为两个串之间配对只有三种情况 1）a[i]b[j]都为字母  2)a[i]或b[j]有一者为字母，一者为‘-’,(这里分开来看算两种情况）所以dp[i][j]=max(dp[i-1][j-1]+value(i,j),dp[i-1][j]+value(i,'-'),dp[i][j-1]+value('-',j));然后注意初始化dp[0][0]=0,dp[i][0]=dp[i-1][0]+value(i,'-'),dp[0][j]=dp[0][j-1]+value('-',j)

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<iostream>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=1e3+50;
int t,a_length,b_length,dp[maxn][maxn];
char a[maxn],b[maxn];

int value[5][5]={{5,-1,-2,-1,-3},
			   	   {-1,5,-3,-2,-4},
			       {-2,-3,5,-2,-2},
			       {-1,-2,-2,5,-1},
			       {-3,-4,-2,-1,inf}};
				   	      
map<char,int> m;

int trimax(int a,int b,int c){
	return max(a,max(b,c));
}

void solve(){
	dp[0][0]=0;
	for(int i=1;i<=a_length;i++){
		int front=m[a[i]];
		int second=m['-'];
		dp[i][0]=dp[i-1][0]+value[front][second];
	}
	for(int j=1;j<=b_length;j++){
		int second=m[b[j]];
		int front=m['-'];
		dp[0][j]=dp[0][j-1]+value[front][second];
	}
	for(int i=1;i<=a_length;i++)
	for(int j=1;j<=b_length;j++){
		int id1=m['-'];
		int id3=m[a[i]];
		int id4=m[b[j]];
		dp[i][j]=trimax(dp[i-1][j-1]+value[id3][id4],dp[i-1][j]+value[id3][id1],dp[i][j-1]+value[id4][id1]);
	}
}

int main(){	
    m['A']=0,m['C']=1,m['G']=2,m['T']=3,m['-']=4;
	while(cin>>t){
		for(int i=0;i<t;i++){
			memset(dp,0,sizeof(dp));
			cin>>a_length;
			cin>>a+1;
			cin>>b_length;
			cin>>b+1; 
			solve();
			printf("%d\n",dp[a_length][b_length]);
		}
	}
	return 0;
}