上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 27 下一页
摘要: 题面:https://www.luogu.org/problemnew/show/P1174 题解:https://www.zybuluo.com/wsndy-xx/note/1145569 阅读全文
posted @ 2018-05-13 17:30 xayata 阅读(122) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problemnew/show/P1037 题解:https://www.zybuluo.com/wsndy-xx/note/1145473 阅读全文
posted @ 2018-05-13 15:39 xayata 阅读(109) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problemnew/show/P1955 题解:https://www.zybuluo.com/wsndy-xx/note/1143858 阅读全文
posted @ 2018-05-11 17:13 xayata 阅读(91) 评论(0) 推荐(0) 编辑
摘要: https://www.zybuluo.com/wsndy-xx/note/1143777 阅读全文
posted @ 2018-05-11 16:36 xayata 阅读(90) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problemnew/show/P2647 题解:https://www.zybuluo.com/wsndy-xx/note/1142685 阅读全文
posted @ 2018-05-10 19:17 xayata 阅读(113) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problemnew/show/P2503 题解:https://www.zybuluo.com/wsndy-xx/note/1141736 阅读全文
posted @ 2018-05-10 10:37 xayata 阅读(94) 评论(0) 推荐(0) 编辑
摘要: // 模板题#include const int N = 2e4 + 10; int n, now = 1, head[N], dis[N]; struct Node {int v, w, nxt;} G[N '9') c = gc; while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = gc; return x; }... 阅读全文
posted @ 2018-05-09 21:41 xayata 阅读(140) 评论(0) 推荐(0) 编辑
摘要: 题面:https://www.luogu.org/problemnew/show/P2634#sub 题解:https://www.zybuluo.com/wsndy-xx/note/1141506 阅读全文
posted @ 2018-05-09 21:17 xayata 阅读(102) 评论(0) 推荐(0) 编辑
摘要: 题解: https://www.zybuluo.com/wsndy-xx/note/1141296 阅读全文
posted @ 2018-05-09 18:00 xayata 阅读(85) 评论(0) 推荐(0) 编辑
摘要: https://www.zybuluo.com/wsndy-xx/note/1140511 阅读全文
posted @ 2018-05-09 16:59 xayata 阅读(88) 评论(0) 推荐(0) 编辑
上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 27 下一页