随笔分类 - ACM-区间DP
摘要：Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3882 Accepted Submission(s): 2309 Pro
阅读全文
摘要：Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game
阅读全文
摘要：The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the r
阅读全文
摘要：现在有n堆石子，第i堆有ai个石子。现在要把这些石子合并成一堆，每次只能合并相邻两个，每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。 Input 第一行包含一个整数T（T<=50），表示数据组数。每组数据第一行包含一个整数n（2<=n<=100），表示石子的堆数。第二行包含n个正整数
阅读全文
