09 2013 档案

HDU 4762 Cut the Cake（公式）
摘要：Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 263Accepted Submission(s): 113Problem DescriptionMMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawb 阅读全文
posted @ 2013-09-29 13:24 Jack Ge 阅读(788) 评论(0) 推荐(0) 编辑
题目1533：最长上升子序列 （nlogn | 树状数组）
摘要：题目1533：最长上升子序列http://ac.jobdu.com/problem.php?pid=1533时间限制：1 秒内存限制：128 兆特殊判题：否提交：857解决：178题目描述：给定一个整型数组， 求这个数组的最长严格递增子序列的长度。 譬如序列1 2 2 4 3 的最长严格递增子序列为1，2，4或1，2，3.他们的长度为3。输入：输入可能包含多个测试案例。对于每个测试案例，输入的第一行为一个整数n(1#include#include#includeusing namespace std;const int N=110000;int n,val[N];vector vt;int b 阅读全文
posted @ 2013-09-21 21:46 Jack Ge 阅读(2697) 评论(0) 推荐(0) 编辑
HDU 3874 Necklace （树状数组 ｜ 线段树 的离线处理）
摘要：NecklaceTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2083Accepted Submission(s): 747Problem DescriptionMery has a beautiful necklace. The necklace is made up of N magic balls. Each ball has a beautiful value. The balls with the same beautiful v 阅读全文
posted @ 2013-09-04 09:01 Jack Ge 阅读(734) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示