本文共 1563 字，大约阅读时间需要 5 分钟。
DFS算，五分钟如果答案没有更新，那个解一般来说就很优了。
#include #include #include #include #include #include #include #include #include #include using namespace std;int const uu[4] = { 1,-1,0,0};int const vv[4] = { 0,0,1,-1};typedef long long ll;int const inf = 0x3f3f3f3f;ll const INF = 0x7fffffffffffffffll;double eps = 1e-10;double pi = acos(-1.0);#define rep(i,s,n) for(int i=(s);i<=(n);++i)#define rep2(i,s,n) for(int i=(s);i>=(n);--i)#define mem(v,n) memset(v,(n),sizeof(v))#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1struct node{ int x,y;}tempAns[205],Ans[205];char FIRST[101][101];bool VIS[101][101];int bestScore;int STEP;bool check(char mp[101][101],int x,int y){ rep(k,0,3){ int xx=x+uu[k], yy=y+vv[k]; if(xx>=1&&xx<=100 && yy>=1&&yy<=100 && mp[xx][yy]==mp[x][y]) return true; } return false;}int color1(char mp[101][101],bool vis[101][101],int x,int y){ vis[x][y]=true; int res=1; rep(k,0,3){ int xx=x+uu[k], yy=y+vv[k]; if(xx>=1&&xx<=100 && yy>=1&&yy<=100 && vis[xx][yy]==false && mp[xx][yy]==mp[x][y]) res+=color1(mp,vis,xx,yy); } mp[x][y]=0; return res;}void proc1(char mp[101][101]){ rep(j,1,10) rep2(i,9,1){ int g=i,h=j; while(g+1<=10 && mp[g+1][h]==0) ++g; mp[g][h]=mp[i][j]; if(g!=i) mp[i][j]=0; } rep(j,2,10){ if(mp[10][j]==0) continue; int k; for(k=j-1;k>=1;--k) if(mp[10][k]!=0) break; if(k+1 bestScore){ STEP=step; rep(i,0,step) Ans[i]=tempAns[i]; bestScore=score; cout<<"bestScore = "< <
转载于:https://www.cnblogs.com/fish7/p/4068750.html