摘要：
Problem Description 我们定义“区间的价值”为一段区间的最大值*最小值。 一个区间左端点在L，右端点在R，那么该区间的长度为(R−L+1)。 现在聪明的杰西想要知道，对于长度为k的区间，最大价值的区间价值是多少。 当然，由于这个问题过于简单。 我们肯定得加强一下。 我们想要知道的是 阅读全文
posted @ 2016-05-25 18:57
Randolph87
阅读(314)
评论(0)
推荐(0)
摘要：
Lesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. Now, each play 阅读全文
posted @ 2016-05-25 17:27
Randolph87
阅读(502)
评论(0)
推荐(0)
摘要：
Description A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. 阅读全文
posted @ 2016-05-25 17:26
Randolph87
阅读(543)
评论(0)
推荐(0)
摘要：
Meanwhile, the kingdom of K is getting ready for the marriage of the King's daughter. However, in order not to lose face in front of the relatives, th 阅读全文
posted @ 2016-05-25 17:26
Randolph87
阅读(241)
评论(0)
推荐(0)
摘要：
Problem Description We are going to distribute apples to n children. Every child has his/her desired number of apple A1,A2,A3,⋯An ， Ai indicates the i 阅读全文
posted @ 2016-05-25 17:26
Randolph87
阅读(307)
评论(0)
推荐(0)
摘要：
Ivan wants to make a necklace as a present to his beloved girl. A necklace is a cyclic sequence of beads of different colors. Ivan says that necklace 阅读全文
posted @ 2016-05-25 17:26
Randolph87
阅读(840)
评论(0)
推荐(0)
摘要：
Vika has an infinite sheet of squared paper. Initially all squares are white. She introduced a two-dimensional coordinate system on this sheet and dre 阅读全文
posted @ 2016-05-25 17:26
Randolph87
阅读(333)
评论(0)
推荐(0)
该文被密码保护。 阅读全文
posted @ 2016-05-25 17:25
Randolph87
阅读(50)
评论(0)
推荐(0)
浙公网安备 33010602011771号