上一页 1 2 3 4 5 6 7 ··· 35 下一页
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K 阅读全文
posted @ 2018-08-19 21:02 cxhscst2 阅读(110) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-19 21:01 cxhscst2 阅读(71) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-11 09:20 cxhscst2 阅读(107) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D 首先对每个点排序,相当于从左边开始扫过来。 把一条线段看成两个点,离散化之后是$cnt$个点,转化成覆盖$cnt$个点的最少花费。 设$f[i][j]$表示覆盖编号$i$到$j$的点的必须的最小花费。 转移的时候在当前区 阅读全文
posted @ 2018-08-11 09:19 cxhscst2 阅读(88) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-11 09:19 cxhscst2 阅读(88) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-11 09:17 cxhscst2 阅读(109) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J 阅读全文
posted @ 2018-08-03 17:05 cxhscst2 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-03 17:04 cxhscst2 阅读(124) 评论(0) 推荐(0) 编辑
摘要: Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L Problem M 阅读全文
posted @ 2018-08-03 17:03 cxhscst2 阅读(118) 评论(0) 推荐(0) 编辑
摘要: Problem A 考虑用欧拉公式降幂 (因为这个模数是质数所以方便很多,不用考虑那些乱七八糟的情况) Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem 阅读全文
posted @ 2018-07-29 14:59 cxhscst2 阅读(138) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 35 下一页