摘要：
Time limit 8000 msMemory limit 65536 kB Yuanfang is puzzled with the question below: T... 阅读全文
摘要：
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,... 阅读全文
摘要：
头文件：#include <iostream> 参数：和sort一样。两个参数——开始地址和结束地址（左闭右开）。 返回值：去重之后的尾地址！！！ 作用：unique的作用是“去掉”容器中相邻元素的重复元素。 解析：unique实质上是一个伪去除，它并不是真正把重复的元素删除，而是用不重复的元素把重 阅读全文
摘要：
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral p... 阅读全文
摘要：
头文件：#include 参数：和sort一样。两个参数——开始地址和结束地址（左闭右开）。返回值：去重之后的尾地址！！！作用：unique的作用是“去掉”容器中相邻元素的重复元素。解析：unique实质上是一个伪去除，它并不是真正把重复的元素删除，而是用不重复的元素... 阅读全文