摘要:题目链接: Heap Partition A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every node is labelled
阅读全文
摘要:题目链接: D. Mishka and Interesting sum time limit per test 3.5 seconds memory limit per test 256 megabytes input standard input output standard output ti
阅读全文
摘要:题目链接: World is Exploding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Given a sequence A with
阅读全文
摘要:题目链接: Bubble Sort Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description P is a permutation of the integ
阅读全文
摘要:题目链接: 拍照 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description 小明在旅游的路上看到了一条美丽的河,河上有许多船只,有的船只向左航行,有的船只向
阅读全文
摘要:题目链接: 区间交 Problem Description 小A有一个含有n个非负整数的数列与mm个区间。每个区间可以表示为li,ri。 它想选择其中k个区间, 使得这些区间的交的那些位置所对应的数的和最大。 例如样例中,选择[2,5]与[4,5]两个区间就可以啦。 Problem De
阅读全文