摘要：跑的好慢啊，看到别人的几百ms，就知道这道题目不能AC了就算数先记在这View Code #include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;const int M =1010;int map[M][M];int vis[M][M];int dir[8][2]={-1,0,-1,1,0,1,1,1,1,0,1,-1,0,-1,-1,-1};int r,c;int sx,sy,ex,ey;struct node{ int x,y 阅读全文

摘要：View Code #include<stdio.h>#include<string.h>#include<stdlib.h>struct node{ char num; struct node *left; struct node *right; // node():left(NULL),right(NULL){}};node *build(node *root,char ch){ if(root==NULL) { root=new node; root->left=NULL; root->right=NULL; ... 阅读全文