MZOJ 1134: 二叉苹果树

按书上大的,dfs还需加强

 #include <bits/stdc++.h>
 #define read read()
 using namespace std;

 int read
 {
     ; char ch = getchar();
      || ch > ) ch = getchar();
     && ch <= ) { x =  * x + ch - ; ch = getchar();}
     return x;
 }

 ;

 int n,q;
 int head[N],size;
 bool vis[N];
 int l[N],r[N],a[N],tot[N];
 int f[N][N];

 struct edge{
     int v,nxt,w;
 }e[N<<];

 void add(int u,int v,int w)
 {
     e[++size].v = v;
     e[size].w = w;
     e[size].nxt = head[u];
     head[u] = size;
 }

 void readdata()
 {
     n = read; q = read; q++;
     int u,v,w;
     ; i < n; i++)
     {
         u = read; v = read; w = read;
         add(u,v,w);
         add(v,u,w);
     }
 }

 void maketree(int u)
 {
     for(int i = head[u]; i ; i = e[i].nxt)
     {
         int v = e[i].v;
         if(vis[v]) continue;
         a[v] = e[i].w;
         vis[v] = ;
         l[u] = v;
         maketree(v);
         break;
     }
     for(int i = head[u]; i ; i = e[i].nxt)
     {
         int v = e[i].v;
         if(vis[v]) continue;
         a[v] = e[i].w;
         vis[v] = ;
         r[u] = v;
         maketree(v);
         break;
     }

 }

 int dp(int i,int j)
 {
     ;
     if(!l[i] && !r[i] )return a[i];
     if(f[i][j]) return f[i][j];
         ; k < j; k++)
             f[i][j] = max(f[i][j], dp(l[i],k) + dp(r[i],j -  - k) + a[i]);
     return f[i][j];
 }

 void work()
 {
     vis[] = ;
     maketree();
     /*for(int i = 1; i <= n; i++)
     {
         printf("%d %d \n",l[i],r[i]);
     }*/
     //for(int i = 1; i <= n; i++) printf("%d ",a[i]);
     printf(,q));
 }

 int main()
 {
 //    freopen("apple tree.in","r",stdin);
     readdata();
     work();
     ;
 }