摘要：
题目 "bzoj2038" 题解 网上题解很多，蒟蒻就不掺和了，这里贴一个写的不错的 "清橙A1206 小Z的袜子(莫队算法)" 我代码差不多也是照着Ta写的，加了一些注释 代码 include include include include include include define N 500 阅读全文
摘要：
题目 "vijos1002" "luogu1052" 题解 很容易想到动态规划，即三十分做法 当L include include include include include include define N 10500 define mod 90 using namespace std; in 阅读全文
摘要：
题目 "bzoj1001" 题解 网络流很经典的建模，先建对偶图，再用最短路跑最小割，注意以左下为s，右上为t 代码 include include include include include include include define N 6001000 define M 2000010 u 阅读全文
摘要：
模板 include include include include include const int N=10000000; const int mod=19260817; using namespace std; int num,prime[N],phi[N],flag[N],last[N], 阅读全文
摘要：
题目 "luogu1177" 代码 include include include include include include define N 100005 using namespace std; int n,a[N]; void quicksort(int l,int r) { int m 阅读全文