算法设计期末题

二分查找，8皇后问题，素数环，加1乘2，电子老鼠闯迷宫，最大子序列和，最长公共子序列

二分查找：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map> 
using namespace std;
const int maxn=50000+50;
map<int,int>mp;
int n,a[maxn],m;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i],mp[a[i]]=1;
	cin>>m;
	while(m--){
		int x;
		cin>>x;
		if(mp[x]==1){
			cout<<"Yes"<<endl;
		}
		else{
			cout<<"No"<<endl;
		}
	}
}

8皇后：

#include<iostream>
#include<algorithm>
using namespace std;
int cnt = 0,a[8];//存储的是每一行中存放皇后的列的位置，如a[1]=8,表示第一行第八列放皇后
//好处，可以直接避免一行出现两个皇后 
bool judge(int sx,int sy){
	int i = 0;
	for(i = 0;i < sx;i++){
		if(a[i] == sy){//前面的某一行中在该一列也有皇后 
			return false;
		}
		if(abs(sx - i)==abs(a[i] - sy)){//注意：要取绝对值，表示对角线中没有皇后 
			return false;
		}
	}
	return true;
}
void print(){
	int i,j;
	cout<<"No "<<cnt<<":"<<endl;
	for(i = 0;i < 8;i++){
		for(j = 1;j <= 8;j++){
			if(a[i] == j){
				cout<<"A";
			}else{
				cout<<".";
			}
		}
		cout<<endl;
	}
}
void dfs(int m){
	if(m == 8){
		cnt++;
		print();
	}else{
		int i;
		for(i = 1;i <= 8;i++){
			if(judge(m,i)){
				a[m] = i;
				dfs(m+1);
				a[m] = 0;//重新置0 
			}
		}
	}
}
int main(){
	dfs(0);
	return 0;
}

素数环：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=105;
int n=20,vis[maxn],a[maxn],cnt;
void swap(int x,int y){
	int t=a[x];
	a[x]=a[y];
	a[y]=t;
}
void dfs(int now){
	int i;
	if(now==n+1){
		if(vis[a[1]+a[20]])return;
		for(i=1;i<=n-1;i++){
			if(vis[a[i]+a[i+1]]){
				return ;
			}
		}
		cnt++;
		if(cnt==2){
			for(i=1;i<=n-1;i++){
				cout<<a[i]<<' ';
			}
			cout<<a[n]<<endl;	
			exit(0);
		}
		return ;
	}
	for(i=now;i<=n;i++){
		swap(i,now);
		if(!vis[a[now]+a[now-1]])
		dfs(now+1);
		swap(i,now);
	}
}
int main(){
	int i,j;
	for(i=1;i<=n;i++)a[i]=i;
	for(i=2;i<=50;i++){
		for(j=2;j<=sqrt(i);j++){
			if(i%j==0){
				vis[i]=1;
				break;
			}
		}
	}
	dfs(1);
	return 0;
} 

加1乘2：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
const int maxn=10000+50; 
int n,m,vis[maxn];
int min(int x,int y){
	return x<=y?x:y;
}
int main(){
	cin>>m>>n;
	memset(vis,0x3f3f3f3f,sizeof(vis));
	vis[m]=1;
	for(int i=m+1;i<=n;i++){
		int t=sqrt(i);
		if(vis[i-1])vis[i]=min(vis[i],vis[i-1]+1);
		if(i%2==0&&vis[i/2])vis[i]=min(vis[i],vis[i/2]+1);
		if(t*t==i&&vis[t])vis[i]=min(vis[i],vis[t]+1);
	}
	cout<<vis[n]-1<<endl;
	return 0;
}

电子老鼠闯迷宫

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=205;
int n,m,sx,sy,tx,ty,a[maxn][maxn],vis[maxn][maxn];
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
struct Point{
	int x,y,cnt;
};
int min(int x,int y){
	return x<=y?x:y;
}
int main(){
	cin>>sx>>sy>>tx>>ty;m=n=12;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			char x;cin>>x;
			if(x=='.')a[i][j]=1;
		}
	queue<Point>q;
	Point now;
	now.x=sx;now.y=sy;now.cnt=0;
	vis[sx][sy]=1;
	q.push(now);
	int ans=0x3f3f3f3f;
	while(!q.empty()){
		now=q.front();q.pop();
		if(now.x==tx&&now.y==ty){
			ans=min(ans,now.cnt);
			continue;
		}
		if(now.cnt>ans)continue;
		for(int i=0;i<4;i++){
			if(now.x+dx[i]>=1&&now.x+dx[i]<=n&&now.y+dy[i]>=1&&now.y+dy[i]<=m&&!vis[now.x+dx[i]][now.y+dy[i]]&&a[now.x+dx[i]][now.y+dy[i]]){
				Point nex;nex.x=now.x+dx[i];nex.y=now.y+dy[i];nex.cnt=now.cnt+1;
				vis[nex.x][nex.y]=1;
				q.push(nex);
			}
		}
	}	
	cout<<ans<<endl;
	return 0;
}

lcs：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1000+50;
char s[maxn],t[maxn];int lens,lent,dp[maxn][maxn];
int max(int x,int y){
	if(x>y)return x;
	return y;
}
int main(){
	scanf("%s%s",s+1,t+1);
	lens=strlen(s+1);
	lent=strlen(t+1);
	for(int i=1;i<=lens;i++){
		for(int j=1;j<=lent;j++){
			if(s[i]==t[j]){
				dp[i][j]=dp[i-1][j-1]+1;
			}
			else{
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
			}
		}
	}
	printf("%d\n",dp[lens][lent]);
	return 0;
}

最大子序列和：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=10000+50;
int n,a[maxn],sum[maxn];
int max(int x,int y){
	if(x>=y)return x;
	return y;
}
int main(){
	int i;
	cin>>n;
	for(i=1;i<=n;i++)cin>>a[i];
	int ans=0;
	for(i=1;i<=n;i++){
		if(sum[i-1]>0)sum[i]=sum[i-1]+a[i];
		else sum[i]=a[i];
		ans=max(ans,sum[i]);
	}
	cout<<ans<<endl;
	return 0;
}