上一页 1 ··· 23 24 25 26 27 28 29 30 31 ··· 66 下一页
摘要: D Game Problem Description 众所周知,度度熊喜欢的字符只有两个:B 和D。今天,它发明了一个游戏:D游戏。度度熊的英文并不是很高明,所以这里的D,没什么高深的含义,只是代指等差数列[(等差数列百科)](http://baike.baidu.com/view/62268.ht 阅读全文
posted @ 2016-05-22 22:06 meekyan 阅读(667) 评论(2) 推荐(0) 编辑
摘要: 1001 区间的价值: RMQ+扫描法 我们预处理RMQ求任意区间的最大值 预处理出以a[i]为最小值 能向左延伸 向右延伸的 L[i], R[i] 那么对于 一个答案 (L[i], R[i]) *rmq(L[i],R[i]) 为此长度的答案,我们可以发现他是可以更新到小于其长度的所有长度答案的,更 阅读全文
posted @ 2016-05-22 16:48 meekyan 阅读(1265) 评论(4) 推荐(0) 编辑
摘要: Sitting in Line Problem Description 度度熊是他同时代中最伟大的数学家,一切数字都要听命于他。现在,又到了度度熊和他的数字仆人们玩排排坐游戏的时候了。游戏的规则十分简单,参与游戏的N个整数将会做成一排,他们将通过不断交换自己的位置,最终达到所有相邻两数乘积的和最大的 阅读全文
posted @ 2016-05-21 20:33 meekyan 阅读(580) 评论(0) 推荐(0) 编辑
摘要: 题目链接: http://bestcoder.hdu.edu.cn/contests/contest_show.php?cid=701 1001 : 矩阵快速幂 #include <iostream> #include <algorithm> #include <cstdio> #include < 阅读全文
posted @ 2016-05-21 17:51 meekyan 阅读(782) 评论(2) 推荐(3) 编辑
摘要: zxa and leaf Problem Description zxa have an unrooted tree with n nodes, including (n−1) undirected edges, whose nodes are numbered from 1 to n. The d 阅读全文
posted @ 2016-05-15 22:44 meekyan 阅读(204) 评论(0) 推荐(1) 编辑
摘要: D. Robin Hood We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return 阅读全文
posted @ 2016-05-13 20:24 meekyan 阅读(229) 评论(0) 推荐(0) 编辑
摘要: C. Recycling Bottles It was recycling day in Kekoland. To celebrate it Adil and Bera went to Central Perk where they can take bottles from the ground 阅读全文
posted @ 2016-05-12 14:32 meekyan 阅读(323) 评论(0) 推荐(0) 编辑
摘要: F. Restore a Number Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integ 阅读全文
posted @ 2016-05-11 19:21 meekyan 阅读(293) 评论(0) 推荐(0) 编辑
摘要: Yada Number Problem Description: Every positive integer can be expressed by multiplication of prime integers. Duoxida says an integer is a yada number 阅读全文
posted @ 2016-05-09 21:25 meekyan 阅读(208) 评论(0) 推荐(0) 编辑
摘要: How many integers can you find Problem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small 阅读全文
posted @ 2016-05-09 21:19 meekyan 阅读(148) 评论(0) 推荐(0) 编辑
上一页 1 ··· 23 24 25 26 27 28 29 30 31 ··· 66 下一页