2016 年 5月随笔档案 - handsomecui

Subsequence（两个单调队列）

摘要：Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5716 Accepted Submission(s): 1884 Pr 阅读全文

posted @ 2016-05-26 22:25 handsomecui 阅读(311) 评论(0) 推荐(0) 编辑

Non-negative Partial Sums（单调队列）

摘要：Non-negative Partial Sums Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2622 Accepted Submissio 阅读全文

posted @ 2016-05-26 19:49 handsomecui 阅读(342) 评论(0) 推荐(0) 编辑

Qwerty78 Trip（组合数，规律，逆元）

摘要：Qwerty78 Trip time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output Qwerty78 Trip time limit pe 阅读全文

posted @ 2016-05-26 16:35 handsomecui 阅读(406) 评论(0) 推荐(0) 编辑

Good Teacher（模拟）

摘要：Good Teacher Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Practice UVA 12662 I want to be a good teacher, so at least 阅读全文

posted @ 2016-05-26 14:53 handsomecui 阅读(340) 评论(0) 推荐(0) 编辑

Jpeg（模拟）

摘要：Jpeg Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice Gym 100947K Jpeg Submit Status Practice Gym 100947K D 阅读全文

posted @ 2016-05-25 22:40 handsomecui 阅读(206) 评论(0) 推荐(0) 编辑

What a Mess（二分）

摘要：What a Mess Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice Gym 100947I What a Mess Submit Status Practice 阅读全文

posted @ 2016-05-25 22:38 handsomecui 阅读(250) 评论(0) 推荐(0) 编辑

Rotate It !!(思维)

摘要：Rotate It !! Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice Gym 100947C Description standard input/output 阅读全文

posted @ 2016-05-25 22:37 handsomecui 阅读(259) 评论(0) 推荐(0) 编辑

High bridge, low bridge（离散化，前缀和）

摘要：High bridge, low bridge Q:There are one high bridge and one low bridge across the river. The river has flooded twice, why thehigh bridge is flooded tw 阅读全文

posted @ 2016-05-25 22:30 handsomecui 阅读(459) 评论(0) 推荐(0) 编辑

严格递增最大连续子段(思维)

摘要：严格递增最大连续子段时间限制: 1 Sec 内存限制: 128 MB 提交: 88 解决: 8 [提交][状态][讨论版] 题目描述给定n个非负元素，你最多可以改变一个元素为任意整数。问可以得到的严格递增连续子段的最大长度。给定n个非负元素，你最多可以改变一个元素为任意整数。问可以得到的严格递阅读全文

posted @ 2016-05-25 22:15 handsomecui 阅读(701) 评论(0) 推荐(0) 编辑

Max Sum of Max-K-sub-sequence(单调队列)

摘要：Max Sum of Max-K-sub-sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7034 Accepted Submi 阅读全文

posted @ 2016-05-24 18:58 handsomecui 阅读(892) 评论(0) 推荐(0) 编辑

Dave(正方形能围成的最大点数)

摘要：Dave Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3524 Accepted Submission(s): 1183 Problem De 阅读全文

posted @ 2016-05-24 16:49 handsomecui 阅读(235) 评论(0) 推荐(0) 编辑

To Miss Our Children Time(dp)

摘要：To Miss Our Children Time Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4502 Accepted Submissio 阅读全文

posted @ 2016-05-24 14:12 handsomecui 阅读(205) 评论(0) 推荐(0) 编辑

The kth great number（set）

摘要：The kth great number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 9407 Accepted Submission(s): 阅读全文

posted @ 2016-05-24 13:01 handsomecui 阅读(379) 评论(0) 推荐(0) 编辑

The Frog's Games（二分）

摘要：The Frog's Games Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 5676 Accepted Submission(s): 273 阅读全文

posted @ 2016-05-24 12:57 handsomecui 阅读(639) 评论(0) 推荐(0) 编辑

Find the maximum(规律，大数)

摘要：Find the maximum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1990 Accepted Submission(s): 837 阅读全文

posted @ 2016-05-24 12:56 handsomecui 阅读(319) 评论(0) 推荐(0) 编辑

Gym Class（拓扑排序）

摘要：Gym Class Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 628 Accepted Submission(s): 244 Proble 阅读全文

posted @ 2016-05-22 21:59 handsomecui 阅读(445) 评论(0) 推荐(0) 编辑

All X（思维）

摘要：All X Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 813 Accepted Submission(s): 392 Problem De 阅读全文

posted @ 2016-05-22 21:52 handsomecui 阅读(318) 评论(0) 推荐(0) 编辑

瞬间移动(组合数，逆元)

摘要：瞬间移动 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 263 Accepted Submission(s): 143 Problem Des 阅读全文

posted @ 2016-05-22 21:21 handsomecui 阅读(219) 评论(0) 推荐(0) 编辑

或运算(思维)

摘要：或运算时间限制: 1 Sec 内存限制: 128 MB 提交: 54 解决: 5 [提交][状态][讨论版] 题目描述给定一个序列，我想知道该序列元素两两间相或后的和。如：有四个元素a b c d 总和为a|b + a|c + a|d + b|c + b|d + c|d。给定一个序列，我想知阅读全文

posted @ 2016-05-22 12:56 handsomecui 阅读(227) 评论(0) 推荐(0) 编辑

Monkey Tradition（中国剩余定理）

摘要：Monkey Tradition Time Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu Submit Status Description In 'MonkeyLand', there is a tradition 阅读全文

posted @ 2016-05-21 22:37 handsomecui 阅读(280) 评论(0) 推荐(0) 编辑

Biorhythms（中国剩余定理）

摘要：Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 127339 Accepted: 40342 Description Some people believe that there are three cycl 阅读全文

posted @ 2016-05-21 21:36 handsomecui 阅读(325) 评论(0) 推荐(0) 编辑

Arithmetic Sequence（dp）

摘要：Arithmetic Sequence Description Giving a number sequence A with length n, you should choosingm numbers from A(ignore the order) which can form an arit 阅读全文

posted @ 2016-05-17 18:02 handsomecui 阅读(271) 评论(0) 推荐(1) 编辑

Number of Parallelograms(求平行四边形个数)

摘要：Number of Parallelograms time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Number of Paral 阅读全文

posted @ 2016-05-17 16:57 handsomecui 阅读(304) 评论(0) 推荐(1) 编辑

Eat Candy(暴力，水)

摘要：Eat Candy Description There is a box with infinite volume. At first there are ncandies in the box. Then every second you will eat some candies, left h 阅读全文

posted @ 2016-05-17 14:16 handsomecui 阅读(391) 评论(0) 推荐(0) 编辑

百度之星B题（组合数）

摘要：Problem B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 181 Accepted Submission(s): 39 Problem 阅读全文

posted @ 2016-05-16 22:18 handsomecui 阅读(214) 评论(0) 推荐(1) 编辑

二叉树的建树，按层遍历，结点总数，页结点，深度以及三序非递归遍历二叉树，建立中序线索二叉树

摘要：二叉树的建树，按层遍历，结点总数，页结点以及深度, 以及三序非递归遍历二叉树；建立一颗二叉树：按层遍历：结点总数，页结点以及深度：三序非递归遍历二叉树：中序线索二叉树：没有头，还不能遍历。。。代码：阅读全文

posted @ 2016-05-16 12:35 handsomecui 阅读(360) 评论(0) 推荐(0) 编辑

志愿者选拔（单调队列）

摘要：Problem 1894 志愿者选拔 Accept: 1783 Submit: 5564 Time Limit: 1500 mSec Memory Limit : 32768 KB Accept: 1783 Submit: 5564 Time Limit: 1500 mSec Memory Limi 阅读全文

posted @ 2016-05-14 09:33 handsomecui 阅读(395) 评论(0) 推荐(0) 编辑

重建二叉树（中后序求前序）

摘要：重建二叉树时间限制：1000 ms | 内存限制：65535 KB 难度：3 重建二叉树时间限制：1000 ms | 内存限制：65535 KB 难度：3 其实也可以不建树，直接输出；代码：阅读全文

posted @ 2016-05-13 14:31 handsomecui 阅读(248) 评论(0) 推荐(0) 编辑

New Year Table（几何）

摘要：New Year Table Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 140A New Year Table Submit Stat 阅读全文

posted @ 2016-05-13 13:37 handsomecui 阅读(243) 评论(0) 推荐(0) 编辑

Hopscotch（细节）

摘要：Hopscotch Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 141B Hopscotch Submit Status Practic 阅读全文

posted @ 2016-05-11 22:21 handsomecui 阅读(290) 评论(0) 推荐(0) 编辑

红黑树（中序二叉树）

摘要：红黑树时间限制：3000 ms | 内存限制：65535 KB 难度：3 红黑树时间限制：3000 ms | 内存限制：65535 KB 难度：3 什么是红黑树呢？顾名思义，跟枣树类似，红黑树是一种叶子是黑色果子是红色的树。。。当然，这个是我说的。。。《算法导论》上可不是这么说的：如果一个阅读全文

posted @ 2016-05-11 13:23 handsomecui 阅读(467) 评论(0) 推荐(1) 编辑

Beans(dp,两次dp)

摘要：Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4141 Accepted Submission(s): 1964 Problem 阅读全文

posted @ 2016-05-10 17:41 handsomecui 阅读(243) 评论(0) 推荐(0) 编辑

Piggy-Bank（完全背包）

摘要：Piggy-Bank Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19387 Accepted Submission(s): 9822 Pr 阅读全文

posted @ 2016-05-10 15:35 handsomecui 阅读(399) 评论(0) 推荐(0) 编辑

Super Jumping! Jumping! Jumping!(dp)

摘要：Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32044 Accepted 阅读全文

posted @ 2016-05-10 14:47 handsomecui 阅读(169) 评论(0) 推荐(0) 编辑

01串（dp）

摘要：01串时间限制：1000 ms | 内存限制：65535 KB 难度：2 01串时间限制：1000 ms | 内存限制：65535 KB 难度：2 ACM的zyc在研究01串，他知道某一01串的长度，但他想知道不含有“11”子串的这种长度的01串共有多少个，他希望你能帮帮他。注：01串的长度为阅读全文

posted @ 2016-05-10 14:27 handsomecui 阅读(234) 评论(0) 推荐(1) 编辑

钱币兑换问题（完全背包）

摘要：钱币兑换问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8865 Accepted Submission(s): 5349 Problem 阅读全文

posted @ 2016-05-10 13:51 handsomecui 阅读(657) 评论(0) 推荐(0) 编辑

计算直线的交点数(set + 打表)

摘要：计算直线的交点数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9357 Accepted Submission(s): 4226 Probl 阅读全文

posted @ 2016-05-09 21:05 handsomecui 阅读(511) 评论(0) 推荐(0) 编辑

Hug the princess（思维，位运算）

摘要：Hug the princess Hug the princess Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status There is a sequence wi 阅读全文

posted @ 2016-05-08 15:02 handsomecui 阅读(251) 评论(0) 推荐(0) 编辑

Fabricate equation（dfs + 模拟）

摘要：Fabricate equation Fabricate equation Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Given an integer Y 阅读全文

posted @ 2016-05-08 14:52 handsomecui 阅读(203) 评论(0) 推荐(0) 编辑

AC Milan VS Juventus（模拟）

摘要：AC Milan VS Juventus AC Milan VS Juventus Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Kennethsnow an 阅读全文

posted @ 2016-05-08 14:44 handsomecui 阅读(188) 评论(0) 推荐(0) 编辑

FZU 2108(dfs模拟，大数取余)

摘要：K Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice FZU 2108 K Submit Status Practice FZU 2108 Description G 阅读全文

posted @ 2016-05-07 15:29 handsomecui 阅读(470) 评论(0) 推荐(0) 编辑

FZU 2102 Solve equation（水，进制转化）&& FZU 2111（贪心，交换使数字最小）

摘要：C Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice FZU 2102 C Submit Status Practice FZU 2102 Description Y 阅读全文

posted @ 2016-05-07 12:39 handsomecui 阅读(187) 评论(0) 推荐(1) 编辑

Bin & Jing in wonderland(概率，组合数学)

摘要：Problem 2103 Bin & Jing in wonderland Accept: 201 Submit: 1048 Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 201 Submit: 1048 Time Limit: 1000 阅读全文

posted @ 2016-05-07 12:31 handsomecui 阅读(305) 评论(0) 推荐(0) 编辑

第十四个目标(dp + 树状数组 + 线段树)

摘要：Problem 2236 第十四个目标 Accept: 17 Submit: 35 Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 17 Submit: 35 Time Limit: 1000 mSec Memory Limit : 327 阅读全文

posted @ 2016-05-03 21:52 handsomecui 阅读(371) 评论(0) 推荐(0) 编辑

炉石传说__multiset

摘要：炉石传说 Problem Description GG学长虽然并不打炉石传说，但是由于题面需要他便学会了打炉石传说。但是传统的炉石传说对于刚入门的GG学长来说有点复杂，所以他决定自己开发一个简化版的炉石传说。在简化版的炉石传说中：每个随从只有生命值和攻击力，并且在你的回合下，你的每只随从在本回合阅读全文

posted @ 2016-05-03 17:58 handsomecui 阅读(333) 评论(0) 推荐(0) 编辑

Beauty of Array(思维)

摘要：Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to k 阅读全文

posted @ 2016-05-03 14:48 handsomecui 阅读(435) 评论(0) 推荐(0) 编辑

LightOJ 1338 && 1387 - Setu && LightOJ 1433 && CodeForces 246B（水题）

摘要：B - B Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1338 B - B Submit Status Practice LightOJ 1338 阅读全文

posted @ 2016-05-02 11:05 handsomecui 阅读(501) 评论(0) 推荐(0) 编辑

Agent J（求三个圆围成的区域面积）

摘要：A - A Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1331 A - A Submit Status Practice LightOJ 1331 阅读全文

posted @ 2016-05-02 10:18 handsomecui 阅读(330) 评论(0) 推荐(0) 编辑

Beauty of Array（模拟）

摘要：M - M Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1261 M - M Submit Status Practice LightOJ 1261 阅读全文

posted @ 2016-05-01 20:38 handsomecui 阅读(188) 评论(0) 推荐(0) 编辑

February 29(模拟)

摘要：D - D Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1414 D - D Submit Status Practice LightOJ 1414 阅读全文

posted @ 2016-05-01 20:34 handsomecui 阅读(297) 评论(0) 推荐(0) 编辑

Team Formation（思维）

摘要：For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his university. Edward 阅读全文

posted @ 2016-05-01 20:22 handsomecui 阅读(429) 评论(0) 推荐(0) 编辑

Capture the Flag(模拟)

摘要：In computer security, Capture the Flag (CTF) is a computer security competition. CTF contests are usually designed to serve as an educational exercise 阅读全文

posted @ 2016-05-01 20:14 handsomecui 阅读(985) 评论(0) 推荐(0) 编辑

handsomecui

05 2016 档案

公告