1、数的增值
#include<bits/stdc++.h>
using namespace std;
int n, ans;
void dfs(int n)
{
ans++;
for (int i = 1; i <= n / 2; i++)
dfs(i);
}
int main()
{
cin >> n;
while(n>=10)
n /= 10;
dfs(n);
cout << ans;
return 0;
}
2、二维矩阵中的最长下降序列
#include<bits/stdc++.h>
using namespace std;
int n,m,a[107][107],f[107][107],ans;
int dx[4]={0,0,1,-1};//上下两个是一对关系,当x不动时,y有加一减一两种方法;
int dy[4]={1,-1,0,0};//当y不动时,x有加一减一两种方法;
int dfs(int x,int y){
if(f[x][y])
return f[x][y];
f[x][y]=1;
for(int i=0,ex,ey;i<4;++i){//遍历该点的上下左右有哪些可能
ex=x+dx[i],ey=y+dy[i];
if(ex<=0 || ey<=0 || ex>n || ey>m || a[ex][ey]>=a[x][y])
continue;//超出四个边界的情况就不管,继续循环;当出现比当前值还大的情况,也不算入下降序列
f[x][y]=max(f[x][y],dfs(ex,ey)+1);
}
return f[x][y];
}
int main(){
cin >> n >> m;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
cin>>a[i][j];
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
ans=max(ans,dfs(i,j));
cout << ans;
}
3、循环空间
#include<bits/stdc++.h>
using namespace std;
const int N = 2007;
struct NODE{
int x,y, d; //·x,y为坐标,d为路程
}currNode, nxtNode, startNode;
int n, a[N][N], b[N][N];
bool vis[N][N];
int dx[6] = {1, -1, 0, 0};
int dy[6] = {0, 0, 1, -1};
void bfs(NODE node){
queue<NODE> q;
q.push(node);
vis[node. x] [node. y] = true;
while(!q.empty()) {
currNode = q.front();
q.pop();
for(int i = 0; i < 4; i++) {
nxtNode.x = (currNode.x + dx[i] + n)% n;
nxtNode.y = (currNode.y + dy[i] + n)% n;
nxtNode.d=currNode.d +1;
if (a[nxtNode.x][nxtNode.y] && !vis[nxtNode.x][nxtNode.y]) {
b[nxtNode. x] [nxtNode. y] = nxtNode.d;
vis [nxtNode.x] [nxtNode.y] = true;
q.push(nxtNode);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin >> n;
for (int i= 0; i < n; i++)
for (int j = 0; j < n; j++){
cin >> a[i][j];
if(a[i][j] == 2)
startNode = {i, j, 0};
}
bfs(startNode);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << b[i][j] << " ";
}
cout << endl;
}
return 0;
}
4.传染病
解题思路:bfs与dfs不同,深度优先遍历重要的是建立队列
#include<bits/stdc++.h>
using namespace std;
struct NODE {
int x, y, z;
}currNode, nxtNode;
int k, n, m, x, y, ans;
char mp[11][11][11];
bool vis[11][11][11];
int dx[6] = {1,-1, 0, 0, 0,0};
int dy[6] = {0, 0, 1, -1, 0, 0};
int dz[6] = {0, 0, 0, 0, 1, -1};
bool check(NODE node) {
int x = node.x, y = node.y, z = node.z;
if (x <=0 || y<=0 || z<=0 || x>n || y>m || z>k)
return false;
if (vis[x][y][z] || mp[x][y][z] == '#')
return false;
return true;
}
void bfs(NODE node){
queue<NODE> q;
q.push(node);
vis[node.x][node. y][node.z] = true;
while (!q.empty()) {
currNode = q.front();
ans++;
q.pop();
for(int i= 0; i < 6; ++i){
nxtNode.x = currNode.x +dx[i];
nxtNode.y = currNode.y +dy[i];
nxtNode.z = currNode.z +dz[i];
if(check(nxtNode)){
q.push(nxtNode);
vis[nxtNode.x][nxtNode.y][nxtNode.z] = true;
}
}
}
}
int main( )
{
cin >> k >> n >> m;
for (int k1 = 1; k1 <= k; k1++)
for (int n1 = 1; n1 <= n; n1++)
for (int m1=1;m1 <=m;m1++)
cin >> mp[n1][m1][k1];
cin >> x >> y;
bfs({x, y, 1});
cout << ans;
return 0;
}