12 2015 档案

展开字符串(dfs)
摘要：展开字符串Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2123Accepted Submission(s): 1019 Problem Des... 阅读全文
posted @ 2015-12-29 22:16 handsomecui 阅读(747) 评论(0) 推荐(0) 编辑
排名（水题）
摘要：排名Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19177Accepted Submission(s): 7033 Problem Descr... 阅读全文
posted @ 2015-12-29 20:59 handsomecui 阅读(364) 评论(0) 推荐(0) 编辑
Identity Card(水题)
摘要：Identity CardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2696Accepted Submission(s): 1048 Pro... 阅读全文
posted @ 2015-12-28 22:27 handsomecui 阅读(962) 评论(0) 推荐(0) 编辑
Dropping Balls （二叉树+思维）
摘要：Dropping BallsA number ofKballs are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visi... 阅读全文
posted @ 2015-12-28 20:53 handsomecui 阅读(546) 评论(0) 推荐(0) 编辑
uva-12657 - Boxes in a Line（双向链表）
摘要：12657 - Boxes in a Line You have n boxes in a line on the table numbered 1 . . . n from left to right. Your task is to simulate 4kinds of commands:• 1 阅读全文
posted @ 2015-12-28 17:15 handsomecui 阅读(772) 评论(0) 推荐(0) 编辑
UVA-Matrix Chain Multiplication（栈）
摘要：Matrix Chain MultiplicationSuppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is ... 阅读全文
posted @ 2015-12-28 15:03 handsomecui 阅读(196) 评论(0) 推荐(0) 编辑
UVA-514 Rails (栈)
摘要：RailsThere is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds... 阅读全文
posted @ 2015-12-28 14:03 handsomecui 阅读(187) 评论(0) 推荐(0) 编辑
Apple Catching(dp)
摘要：Apple CatchingTime Limit:1000MSMemory Limit:65536KTotal Submissions:9831Accepted:4779DescriptionIt is a little known fact that cows love apples. Farme... 阅读全文
posted @ 2015-12-28 13:05 handsomecui 阅读(339) 评论(0) 推荐(0) 编辑
Curling 2.0(dfs回溯)
摘要：Curling 2.0Time Limit:1000MSMemory Limit:65536KTotal Submissions:15567Accepted:6434DescriptionOn Planet MM-21, after their Olympic games this year, cu... 阅读全文
posted @ 2015-12-28 11:14 handsomecui 阅读(246) 评论(0) 推荐(0) 编辑
River Hopscotch（二分最大化最小值）
摘要：River HopscotchTime Limit:2000MSMemory Limit:65536KTotal Submissions:9923Accepted:4252DescriptionEvery year the cows hold an event featuring a peculia... 阅读全文
posted @ 2015-12-28 10:21 handsomecui 阅读(513) 评论(0) 推荐(0) 编辑
The Longest Straight（二分，离散化）
摘要：Problem 2216 The Longest StraightAccept: 7Submit: 14 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionZB is playing a card game where th... 阅读全文
posted @ 2015-12-27 21:26 handsomecui 阅读(327) 评论(0) 推荐(0) 编辑
2015福建省赛
摘要：Problem A Super Mobile ChargerAccept: 217Submit: 402 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionWhile HIT ACM Group finished their... 阅读全文
posted @ 2015-12-27 21:24 handsomecui 阅读(707) 评论(0) 推荐(0) 编辑
N bulbs（规律）
摘要：N bulbsAccepts: 408Submissions: 1224Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionN bulbs are in ... 阅读全文
posted @ 2015-12-26 20:45 handsomecui 阅读(336) 评论(0) 推荐(0) 编辑
杭电校赛（虐哭。。。）
摘要：写了半天写三道水题。。。虐哭。。。。The Country ListTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 0Accepted Submi... 阅读全文
posted @ 2015-12-26 16:31 handsomecui 阅读(304) 评论(0) 推荐(0) 编辑
Cow Acrobats(贪心)
摘要：Cow AcrobatsTime Limit:1000MSMemory Limit:65536KTotal Submissions:3686Accepted:1428DescriptionFarmer John's N (1 #include#include#includeusing namespa... 阅读全文
posted @ 2015-12-20 16:54 handsomecui 阅读(195) 评论(0) 推荐(0) 编辑
Sumsets（完全背包）
摘要：SumsetsTime Limit:2000MSMemory Limit:200000KTotal Submissions:15045Accepted:5997DescriptionFarmer John commanded his cows to search for different sets... 阅读全文
posted @ 2015-12-20 16:50 handsomecui 阅读(236) 评论(0) 推荐(0) 编辑
How many prime numbers（求素数个数）
摘要：How many prime numbersTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14684Accepted Submission(s)... 阅读全文
posted @ 2015-12-20 15:31 handsomecui 阅读(416) 评论(0) 推荐(0) 编辑
Ants（思维）
摘要：AntsTime Limit:1000MSMemory Limit:30000KTotal Submissions:12893Accepted:5637DescriptionAn army of ants walk on a horizontal pole of length l cm, each ... 阅读全文
posted @ 2015-12-20 15:24 handsomecui 阅读(403) 评论(0) 推荐(0) 编辑
I can do it!（贪心）
摘要：I can do it!Time Limit: 2000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1010Accepted Submission(s): 471 Probl... 阅读全文
posted @ 2015-12-20 15:16 handsomecui 阅读(275) 评论(0) 推荐(0) 编辑
不可摸数
摘要：不可摸数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10585Accepted Submission(s): 2734 Problem Des... 阅读全文
posted @ 2015-12-18 09:52 handsomecui 阅读(636) 评论(0) 推荐(0) 编辑
跳跃的舞者，舞蹈链（Dancing Links）算法——求解精确覆盖问题（转）
摘要：跳跃的舞者，舞蹈链（Dancing Links）算法——求解精确覆盖问题转：http://www.cnblogs.com/grenet/p/3145800.html精确覆盖问题的定义：给定一个由0-1组成的矩阵，是否能找到一个行的集合，使得集合中每一列都恰好包含一个1例如：如下的矩阵就包含了这样一个... 阅读全文
posted @ 2015-12-13 10:35 handsomecui 阅读(205) 评论(0) 推荐(0) 编辑
GTW likes math（简单数学）
摘要：GTW likes mathAccepts: 472Submissions: 2140Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionAfter a... 阅读全文
posted @ 2015-12-12 21:47 handsomecui 阅读(253) 评论(0) 推荐(0) 编辑
ZYB's Premutation(有逆序数输出原序列，线段树)
摘要：ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 758Accepted Submission(s): 359... 阅读全文
posted @ 2015-12-12 21:38 handsomecui 阅读(413) 评论(0) 推荐(0) 编辑
Drying(贪心)
摘要：Drying Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11512 Accepted: 2977 Description It is very hard to wash and especially to dry cloth 阅读全文
posted @ 2015-12-12 13:45 handsomecui 阅读(328) 评论(0) 推荐(0) 编辑
Winter(bfs&&dfs)
摘要：1084 - WinterPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBWinter is coming. In a land far away,Nmen are spending the nights in ... 阅读全文
posted @ 2015-12-12 10:51 handsomecui 阅读(562) 评论(0) 推荐(0) 编辑
Just another Robbery(背包)
摘要：1079 - Just another RobberyPDF (English)StatisticsForumTime Limit:4 second(s)Memory Limit:32 MBAs Harry Potter series is over, Harry has no job. Since... 阅读全文
posted @ 2015-12-10 22:32 handsomecui 阅读(287) 评论(0) 推荐(0) 编辑
Special Subsequence（离散化线段树+dp）
摘要：Special SubsequenceTime Limit: 5 Seconds Memory Limit: 32768 KBThere a sequence S with n integers , and A is a special subsequence that satisfies |Ai-... 阅读全文
posted @ 2015-12-10 22:02 handsomecui 阅读(526) 评论(0) 推荐(0) 编辑
过河（bfs）
摘要：Problem 2188 过河IAccept: 112Submit: 277 Time Limit: 3000 mSecMemory Limit : 32768 KBProblem Description一天，小明需要把x只羊和y只狼运输到河对面。船可以容纳n只动物和小明。每次小明划船时，都必须至少... 阅读全文
posted @ 2015-12-10 20:27 handsomecui 阅读(287) 评论(0) 推荐(0) 编辑
squee_spoon and his Cube VI(贪心，找不含一组字符串的最大长度+kmp)
摘要：1818: squee_spoon and his Cube VITime Limit:1 SecMemory Limit:128 MB Submit:77Solved:22SubmitStatusWeb BoardDescription市面上最常见的魔方，是三阶魔方，英文名为Rubik's Cub... 阅读全文
posted @ 2015-12-10 19:04 handsomecui 阅读(335) 评论(0) 推荐(0) 编辑
合式公式
摘要：以前写的，现在又被我捞出来了。。。。#include#includeusing namespace std;const int MAXN=100010;#define al(x)(x>='a'&&xdl;int stnum,alnum;bool sup(){ char a,b; while(!dl.... 阅读全文
posted @ 2015-12-08 22:28 handsomecui 阅读(1037) 评论(0) 推荐(0) 编辑
矩形(两个矩形覆盖面积)
摘要：1816: 矩形Time Limit:1 SecMemory Limit:128 MB Submit:93Solved:25SubmitStatusWeb BoardDescription小S和小D两个小雪参，在玩一个关于矩形的游戏以帮助他们学会怎么计算矩形的面积然后完成作业去打游戏（两个小雪参一起... 阅读全文
posted @ 2015-12-08 22:00 handsomecui 阅读(1237) 评论(0) 推荐(0) 编辑
A计划（bfs）
摘要：A计划Time Limit : 3000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 1Problem Description可怜... 阅读全文
posted @ 2015-12-08 20:20 handsomecui 阅读(227) 评论(0) 推荐(0) 编辑
郑大校赛
摘要：总结：水平太菜；Problem B: make pairTime Limit:1 SecMemory Limit:128 MB Submit:53Solved:40SubmitStatusWeb BoardDescriptionpair是c++标准模板库中一种十分有用的模板类型，它是一个二元组。我们... 阅读全文
posted @ 2015-12-08 19:31 handsomecui 阅读(690) 评论(0) 推荐(0) 编辑
Airport（未解决。。。）
摘要：AirportTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1534Accepted Submission(s): 486Problem Desc... 阅读全文
posted @ 2015-12-06 17:36 handsomecui 阅读(221) 评论(0) 推荐(0) 编辑
Tree（未解决。。。）
摘要：TreeTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2968Accepted Submission(s): 507Problem Descri... 阅读全文
posted @ 2015-12-06 17:28 handsomecui 阅读(206) 评论(0) 推荐(0) 编辑
Fractal(递归，好题)
摘要：FractalTime Limit:1000MSMemory Limit:30000KTotal Submissions:8341Accepted:3965DescriptionA fractal is an object or quantity that displays self-similar... 阅读全文
posted @ 2015-12-06 16:44 handsomecui 阅读(459) 评论(0) 推荐(0) 编辑
Scrambled Polygon(凸多边形，斜率)
摘要：Scrambled PolygonTime Limit:1000MSMemory Limit:30000KTotal Submissions:7805Accepted:3712DescriptionA closed polygon is a figure bounded by a finite nu... 阅读全文
posted @ 2015-12-06 15:39 handsomecui 阅读(416) 评论(0) 推荐(0) 编辑
ZYB's Game(博弈)
摘要：ZYB's GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 190Accepted Submission(s): 162Problem De... 阅读全文
posted @ 2015-12-06 15:17 handsomecui 阅读(185) 评论(0) 推荐(1) 编辑
Dancing Stars on Me（判断正多边形）
摘要：Dancing Stars on MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 592Accepted Submission(s): 3... 阅读全文
posted @ 2015-12-06 14:41 handsomecui 阅读(382) 评论(0) 推荐(0) 编辑
Hidden String（深搜）
摘要：Hidden String Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1679 Accepted Submission(s): 591 阅读全文
posted @ 2015-12-06 14:36 handsomecui 阅读(223) 评论(0) 推荐(0) 编辑
1043 - Triangle Partitioning（数学）
摘要：1043 - Triangle PartitioningPDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBSee the picture below.You are given AB, AC and BC.... 阅读全文
posted @ 2015-12-06 14:31 handsomecui 阅读(307) 评论(0) 推荐(0) 编辑
TEX Quotes(字符串，水)
摘要：TEX QuotesTime Limit:1000MSMemory Limit:10000KTotal Submissions:9674Accepted:5073DescriptionTEX is a typesetting language developed by Donald Knuth. I... 阅读全文
posted @ 2015-12-06 14:27 handsomecui 阅读(799) 评论(0) 推荐(0) 编辑
Candy Sharing Game(模拟搜索)
摘要：Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4425Accepted Submission(s): 269... 阅读全文
posted @ 2015-12-06 14:20 handsomecui 阅读(553) 评论(0) 推荐(0) 编辑
hpu校赛--雪人的高度（离散化线段树）
摘要：大雪过后，KK决定在春秋大道的某些区间上堆雪人。现在KK遇到了一道统计雪人高度的难题，请你帮帮他吧。注：KK堆雪人前春秋大道上是没有雪人的即所有位置雪人高度为0。 给定一个整数t，表示有t(t<=5)组测试数据。每组测试数据有两个整数N(1<=N<=200000)，表示N次操作。 操作分四种: U1 阅读全文
posted @ 2015-12-05 22:31 handsomecui 阅读(236) 评论(0) 推荐(0) 编辑
Scrambled Polygon(斜率排序)
摘要：Scrambled PolygonTime Limit:1000MSMemory Limit:30000KTotal Submissions:7799Accepted:3707DescriptionA closed polygon is a figure bounded by a finite nu... 阅读全文
posted @ 2015-12-05 20:39 handsomecui 阅读(632) 评论(0) 推荐(0) 编辑
Minimum Inversion Number（线段树求逆序数）
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15517Accepted Submission(... 阅读全文
posted @ 2015-12-04 19:52 handsomecui 阅读(266) 评论(0) 推荐(0) 编辑
3027 - Corporative Network（并差集）
摘要：3027 - Corporative Network A very big corporation is developing its corporative network. In the beginning each of the N enterprisesof the corpora... 阅读全文
posted @ 2015-12-04 17:56 handsomecui 阅读(467) 评论(0) 推荐(0) 编辑
Break the Chocolate（规律）
摘要：Break the ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4662Accepted Submission(s): 15... 阅读全文
posted @ 2015-12-04 13:47 handsomecui 阅读(366) 评论(0) 推荐(0) 编辑
小明系列故事——未知剩余系（反素数，好）
摘要：小明系列故事——未知剩余系Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1281Accepted Submission(s): 319 Proble... 阅读全文
posted @ 2015-12-03 22:24 handsomecui 阅读(318) 评论(0) 推荐(0) 编辑
反素数（暴力）
摘要：反素数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5194Accepted Submission(s): 3043 Problem Descr... 阅读全文
posted @ 2015-12-03 21:17 handsomecui 阅读(345) 评论(0) 推荐(0) 编辑
More Divisors(反素数)
摘要：More DivisorsTime Limit: 2 Seconds Memory Limit: 65536 KBEverybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians... 阅读全文
posted @ 2015-12-03 20:40 handsomecui 阅读(277) 评论(0) 推荐(0) 编辑
CodeForces - 27E--Number With The Given Amount Of Divisors（反素数）
摘要：CodeForces - 27ENumber With The Given Amount Of DivisorsSubmitStatusDescriptionGiven the numbern, find the smallest positive integer which has exactly... 阅读全文
posted @ 2015-12-03 20:14 handsomecui 阅读(722) 评论(0) 推荐(0) 编辑
Binary Tree（二叉树+思维）
摘要：Binary TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 138Accepted Submission(s): 73 Special ... 阅读全文
posted @ 2015-12-03 14:02 handsomecui 阅读(492) 评论(0) 推荐(0) 编辑
Friendship of Frog(水题)
摘要：Friendship of FrogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 135 Accepted Submission(s): 10... 阅读全文
posted @ 2015-12-02 14:13 handsomecui 阅读(404) 评论(0) 推荐(0) 编辑
11997 - K Smallest Sums(优先队列)
摘要：11997 - K Smallest SumsYou’re given k arrays, each array has k integers. There are kk ways to pick exactly one element in eacharray and calculate ... 阅读全文
posted @ 2015-12-02 12:42 handsomecui 阅读(254) 评论(0) 推荐(0) 编辑
3644 - X-Plosives（水题，并差集）
摘要：3644 - X-PlosivesA secret service developed a new kind of explosive that attain its volatile property only when a specificassociation of products occu... 阅读全文
posted @ 2015-12-01 22:23 handsomecui 阅读(256) 评论(0) 推荐(0) 编辑
LA-3135 - Argus(优先队列)
摘要：3135 - Argus A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensordata, Internet traffic, financial tic... 阅读全文
posted @ 2015-12-01 21:06 handsomecui 阅读(312) 评论(0) 推荐(0) 编辑
hpuoj回文串问题(manacher+kmp)
摘要：1699: 回文串问题时间限制: 1 Sec 内存限制: 128 MB 提交: 22 解决: 3 [提交][状态][讨论版]题目描述还是回文串问题，字符串是啥，大家应该都知道，就是满足 S[i] = S[L - i + 1] (1 #include#include#include#include#i... 阅读全文
posted @ 2015-12-01 18:42 handsomecui 阅读(212) 评论(0) 推荐(0) 编辑
uva--11991 - Easy Problem from Rujia Liu?（sort+二分 map+vector vector）
摘要：11991 - Easy Problem from Rujia Liu? Though Rujia Liu usually sets hard problems for contests (for example, regional contests likeXi’an 2006, Beiji... 阅读全文
posted @ 2015-12-01 17:31 handsomecui 阅读(265) 评论(0) 推荐(0) 编辑
uva-11995 - I Can Guess the Data Structure!（栈，优先队列，队列，水题）
摘要：11995 - I Can Guess the Data Structure! There is a bag-like data structure, supporting two operations:1 x Throw an element x into the bag.2 Take out ... 阅读全文
posted @ 2015-12-01 16:39 handsomecui 阅读(203) 评论(0) 推荐(0) 编辑
数据结构---线段树
摘要：线段树转载请注明出处，谢谢！http://blog.csdn.net/metalseed/article/details/8039326持续更新中···一：线段树基本概念1：概述线段树，类似区间树，是一个完全二叉树，它在各个节点保存一条线段（数组中的一段子数组），主要用于高效解决连续区间的动态查询问... 阅读全文
posted @ 2015-12-01 15:54 handsomecui 阅读(273) 评论(0) 推荐(0) 编辑