摘要:
```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, 阅读全文
摘要:
题面毒人,其实就是叫你反图跑拓扑 阅读全文
摘要:
每次入队时DP : $f[v] = \max \{f[u] + 1\}$ 阅读全文