2017ICPC北京 J:Pangu and Stones
#1636 : Pangu and Stones
描述
In Chinese mythology, Pangu is the first living being and the creator of the sky and the earth. He woke up from an egg and split the egg into two parts: the sky and the earth.
At the beginning, there was no mountain on the earth, only stones all over the land.
There were N piles of stones, numbered from 1 to N. Pangu wanted to merge all of them into one pile to build a great mountain. If the sum of stones of some piles was S, Pangu would need S seconds to pile them into one pile, and there would be S stones in the new pile.
Unfortunately, every time Pangu could only merge successive piles into one pile. And the number of piles he merged shouldn't be less than L or greater than R.
Pangu wanted to finish this as soon as possible.
Can you help him? If there was no solution, you should answer '0'.
输入
There are multiple test cases.
The first line of each case contains three integers N,L,R as above mentioned (2<=N<=100,2<=L<=R<=N).
The second line of each case contains N integers a1,a2 …aN (1<= ai <=1000,i= 1…N ), indicating the number of stones of pile 1, pile 2 …pile N.
The number of test cases is less than 110 and there are at most 5 test cases in which N >= 50.
输出
For each test case, you should output the minimum time(in seconds) Pangu had to take . If it was impossible for Pangu to do his job, you should output 0.
- 样例输入
-
3 2 2 1 2 3 3 2 3 1 2 3 4 3 3 1 2 3 4
- 样例输出
-
9 6 0
相关文章
- [Javascript] Getter and Setter Abstractions
- License Plate Detection and Recognition in Unconstrained Scenarios(无约束场景下的车牌检测与识别)
- UML Use Case Diagrams: Tips and FAQ
- [Functional Programming Monad] Map And Evaluate State With A Stateful Monad
- [Angular 2] Move and Delete Angular 2 Components After Creation
- between...and..
- CRM Extension field render and property handling
- Atitit.软件gui按钮and面板---os区-----linux windows搜索文件 文件夹
- Atitit.实现反向代理(1)----url rewrite 配置and内容改写 and -绝对路径链接改写 java php
- 成功解决TypeError: ufunc 'sqrt' not supported for the input types, and the inputs could not be safely co
- 73_leetcode_Construct Binary Tree from Inorder and Postorder Traversal
- 论文解读(DMVCJ)《Deep Embedded Multi-View Clustering via Jointly Learning Latent Representations and Graphs》