摘要：
A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the... 阅读全文
摘要：
现在有n堆果子，第i堆有ai个果子。现在要把这些果子合并成一堆，每次合并的代价是两堆果子的总果子数。求合并所有果子的最小代价。Input第一行包含一个整数T（T#include using namespace std;struct cmp{ bool operato... 阅读全文
摘要：
Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to 阅读全文
摘要：
Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers,... 阅读全文