樱花落舞

2016年8月21日

摘要： Description Masha wants to open her own bakery and bake muffins in one of the n cities numbered from 1 to n. There are m bidirectional roads, each of 阅读全文

posted @ 2016-08-21 12:48 樱花落舞阅读(247) 评论(0) 推荐(0) 编辑

Codeforces Round #368 (Div. 2) A

摘要： Description Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of 阅读全文

posted @ 2016-08-21 12:13 樱花落舞阅读(251) 评论(0) 推荐(0) 编辑

2016年8月9日

Codeforces Round #366 (Div. 2) B

摘要： Description Peter Parker wants to play a game with Dr. Octopus. The game is about cycles. Cycle is a sequence of vertices, such that first one is conn 阅读全文

posted @ 2016-08-09 00:07 樱花落舞阅读(230) 评论(0) 推荐(0) 编辑

Codeforces Round #366 (Div. 2) A

摘要： Description Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's 阅读全文

posted @ 2016-08-09 00:01 樱花落舞阅读(774) 评论(0) 推荐(0) 编辑

2016年8月6日

BestCoder Round #86 1003

摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=5806 题意：有多少个区间里的第 k 大的数不小于 m 解法：尺取法，首先我们用dp[i]保存到i的位置有多少大于m的数 l=1，r=1，r开始遍历,只要符合dp[l]-dp[r]==k就是sum+=（n-r 阅读全文

posted @ 2016-08-06 22:29 樱花落舞阅读(177) 评论(0) 推荐(0) 编辑

BestCoder Round #86 1002

摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=5805 题意：删除数列中一个数，找出相邻之差绝对值最大，求依次删除最大值的和解法：删除边缘位置的数字需要注意它们的差就是 a[i-1]-a[i-2] ，a[i+2]-a[i+1],a[i-1]-a[i+1 阅读全文

posted @ 2016-08-06 22:20 樱花落舞阅读(214) 评论(0) 推荐(0) 编辑

BestCoder Round #86 1001

摘要：链接http://acm.hdu.edu.cn/showproblem.php?pid=5804 题意：给你一些商店和他的商品价格，然后给你一个记账本，问你记大了就是1，否则是0 解法：模拟，注意测试数据大小阅读全文

posted @ 2016-08-06 22:08 樱花落舞阅读(215) 评论(0) 推荐(0) 编辑

Codeforces Round #365 (Div. 2) B

摘要： Description Little Mishka is a great traveller and she visited many countries. After thinking about where to travel this time, she chose XXX — beautif 阅读全文

posted @ 2016-08-06 17:55 樱花落舞阅读(265) 评论(0) 推荐(0) 编辑

Codeforces Round #365 (Div. 2) A

摘要： Description Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunn 阅读全文

posted @ 2016-08-06 14:31 樱花落舞阅读(260) 评论(0) 推荐(0) 编辑

2016年7月30日

Codeforces Round #129 (Div. 2) C

摘要： Description The Little Elephant very much loves sums on intervals. This time he has a pair of integers l and r (l ≤ r). The Little Elephant has to fin 阅读全文

posted @ 2016-07-30 17:26 樱花落舞阅读(265) 评论(0) 推荐(0) 编辑

爱学姐！爱学妹！

公告