nywsp的专栏

# include # include # include # define N 363000 using namespace std; bool visit[N]; char visit1[N]; int pre[N],st,a[10],end; int dir[9]={1,1,2,6,24,120,720,5040,40320}; struct node{ int

#include #include int st[105][105]; int vi[105][105]; int ans; int max,min; int n,fla; int fx[]={0,0,1,-1}; int fy[]={1,-1,0,0}; void dfs(int x,int y,int ma,int min) { // printf("%d %dxyxy\n",x,y); if