DrWells的博客

Description现在有n堆石子，第i堆有ai个石子。现在要把这些石子合并成一堆，每次只能合并相邻两个，每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。Input第一行包含一个整数T（T<=50），表示数据组数。 每组数据第一行包含一个整数n（2<=n<=100），表示石子的堆数。 第二行包含n个正整数ai（ai<=100），表示每堆石子的石子数。Output每组数据仅一行，表

BracketsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 8536 Accepted: 4553DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence

You Are the OneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4280 Accepted Submission(s): 1989Problem Description　　The TV shows such as Yo

Halloween CostumesGappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it’s Halloween, these parties are all cos

String painterTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4626 Accepted Submission(s): 2171Problem DescriptionThere are two strings A an

1980: 不堪重负的树 Submit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 8 Solved: 2 Description 小X非常喜欢树，然后他生成了一个大森林给自己玩。 玩着玩着，小X陷入了沉思。一棵树由N个节点组成，编号为i的节点有一个价值Wi。 假设从树

B. Zumatime limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard output Genos recently installed the game Zuma on his phone. In Zuma there exists a line of

D. Coloring Brackets time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Once Petya read a problem about a bracket sequence. He gave it much t