typedef_struct的博客

动态规划算法

二叉树（未完成）struct Node{ bool have_value; int v; Node *left,*right; Node():have_value(false),left(NULL),left(NULL){} };char s[maxn]; bool read_input(){ failed = false; root

#include<iostream> #include<string> #include<sstream> #include<algorithm>using namespace std;const int maxv = 1000 + 10; int in_order[maxv],post_order[maxv],lch[maxv],rch[maxv]; int n;bool read_list(in