上一页 1 2 3 4 5 6 7 8 9 10 ··· 36 下一页
摘要: "ref" cpp include include using namespace std; int n, m, a[100005], opt, uu, vv, fa[100005], ch[100005][2], dis[100005]; int myfind(int x){ while(fa[x 阅读全文
posted @ 2018-05-08 19:51 poorpool 阅读(143) 评论(0) 推荐(0) 编辑
摘要: "ref" cpp include include include include include using namespace std; int n; char su[2005], sv[2005]; vector vec; void shift(int x){ if(x==0) return 阅读全文
posted @ 2018-05-08 18:44 poorpool 阅读(490) 评论(0) 推荐(0) 编辑
摘要: "ref" 阅读全文
posted @ 2018-05-08 10:36 poorpool 阅读(281) 评论(0) 推荐(0) 编辑
摘要: "ref" cpp include include include include using namespace std; typedef long long ll; int n, m, k, uu, vv, hea[105], cnt, tot[105]; ll b[105][1005], s[ 阅读全文
posted @ 2018-05-08 09:05 poorpool 阅读(124) 评论(0) 推荐(0) 编辑
摘要: "ref" cpp include include include using namespace std; typedef long long ll; int n, k, a[305], c[305]; ll w[305], dp[305][305][265], g[2]; int main(){ 阅读全文
posted @ 2018-05-07 20:45 poorpool 阅读(206) 评论(0) 推荐(0) 编辑
摘要: cpp include include include include using namespace std; int n, m, e, a[305], w[305][305], uu, vv, ww, hea[805], cnt, ss, tt, maxFlow; int lev[805], c 阅读全文
posted @ 2018-05-07 19:25 poorpool 阅读(151) 评论(0) 推荐(0) 编辑
摘要: "ref" cpp include include include include using namespace std; int n, m, q, a[100005], uu, vv, hea[100005], cnt, dfn[100005], loo[100005]; int idx, du 阅读全文
posted @ 2018-05-07 16:50 poorpool 阅读(244) 评论(0) 推荐(0) 编辑
摘要: 答案就是错排数 阅读全文
posted @ 2018-05-07 11:27 poorpool 阅读(138) 评论(0) 推荐(0) 编辑
摘要: "字符串好难啊不会啊" cpp include include using namespace std; int n, m, rnk[100005], cnt[100005], tmp[100005], p, mx=128, saa[100005], tot, a, b; int height[10 阅读全文
posted @ 2018-05-07 10:59 poorpool 阅读(346) 评论(0) 推荐(0) 编辑
摘要: 可持久化trie。考场上我脑补了一个trie树合并也A了 cpp include include include using namespace std; int n, k, m, dfnl[100005], dfnr[100005], idx, rot[100005], v[100005], uu 阅读全文
posted @ 2018-05-06 21:29 poorpool 阅读(226) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 36 下一页