![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树
sunbaofeng2
这个作者很懒,什么都没留下…
展开
-
839 - Not so Mobile--递归水题
#include #include #include #include #include #define N 10005 using namespace std; int flag; int build() { int wl,wr,dl,dr; scanf("%d%d%d%d",&wl,&dl,&wr,&dr); if(wl==0)原创 2012-08-10 21:02:02 · 451 阅读 · 0 评论 -
548 Tree
#include #include #include #include #include #define N 10005 using namespace std; int a[N],b[N]; int m,value; void build(int a[],int b[],int n,int sum) { if(n else if(n==1原创 2012-08-10 20:24:52 · 312 阅读 · 0 评论 -
表达式树
#include #include #include #include #include #include #include #include #define LL long long #define inf 0x7fffffff #define E 1e-9 #define M 100 #define N 10010 using namespace std; char str[N]; char原创 2012-09-26 19:28:32 · 428 阅读 · 0 评论