摘要:
枚举末位状态 cpp include include include include include define R(a,b,c) for(register int a = (b); a = (c); a) define Max(a,b) ((a) (b) ? (a) : (b)) define 阅读全文
摘要:
曾经放弃的坑,都是坑 cpp include include include include include define R(a,b,c) for(register int a = (b); a = (c); a) define Max(a,b) ((a) (b) ? (a) : (b)) def 阅读全文
摘要:
我bingoyes再高精用STL就饿死,死外边! string真的爽。。。 斯特林数模板题:$S(n,m) = S(n 1,m 1)+S(n 1,m) n$ cpp include include include include include define R(a,b,c) for(registe 阅读全文
摘要:
一边一定是直径,另一边从两端点走取最小值的最大值 阅读全文
摘要:
本是要练线段树的,却手贱打了个分块 阅读全文
摘要:
倒着来 阅读全文
摘要:
没开long long见祖宗。。。 BIT先求逆序对来造表存展开关系,线段树维护01进制 阅读全文
摘要:
简单 的$A B$ $Problem$,卡精度卡到想女装 阅读全文
摘要:
$n^2$暴力 BIT优化 阅读全文
摘要:
皮一波 阅读全文
摘要:
水题,水得好无语 阅读全文
摘要:
我是个傻逼,这么水的题都会T 阅读全文
摘要:
```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\}$ 阅读全文