Unverified Commit 2376a50c authored by Shuhao Zhang's avatar Shuhao Zhang Committed by GitHub
Browse files

fix(dp/tree): fix format

parent 749d7368

docs/dp/tree.md

+10 −4
Original line number Diff line number Diff line
@@ -91,9 +91,14 @@ $$ 
我们可以证明，该做法的时间复杂度为 $O(nm)$ [^note1]。



??? note "参考代码"

    \#include<cstdio>#include<algorithm>using namespace std;

    ```cpp

    #include<cstdio>

    #include<algorithm>

    using namespace std;

    struct edge

    {int v,next;}e[305];

    {

     int v,next;

    }e[305];

    int head[305],f[305][305],cnt,s[305];

    void addedge(int u,int v)

    {
@@ -132,6 +137,7 @@ $$ 
     printf("%d",f[0][m+1]);

     return 0;

    }

    ```



## 习题