摘要:
```cpp include "Head.cpp" const int N = 10007; int n, m; struct Point{ int x,y; bool operator = 0) top; sta[++top] = a[i]; } int mid = top; nR(i,n 2, 阅读全文
posted @ 2019-07-23 10:10
邱涵的秘密基地
阅读(213)
评论(0)
推荐(0)
摘要:
题面毒人,其实就是叫你反图跑拓扑 阅读全文
posted @ 2019-07-23 09:28
邱涵的秘密基地
阅读(150)
评论(0)
推荐(0)
摘要:
每次入队时DP : $f[v] = \max \{f[u] + 1\}$ 阅读全文
posted @ 2019-07-23 08:39
邱涵的秘密基地
阅读(150)
评论(0)
推荐(0)

浙公网安备 33010602011771号