handsomecui

2015年12月6日

摘要： 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 阅读(391) 评论(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 阅读(231) 评论(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 阅读(320) 评论(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 阅读(808) 评论(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 阅读(559) 评论(0) 推荐(0)

2015年12月5日

hpu校赛--雪人的高度（离散化线段树）

摘要：大雪过后，KK决定在春秋大道的某些区间上堆雪人。现在KK遇到了一道统计雪人高度的难题，请你帮帮他吧。注：KK堆雪人前春秋大道上是没有雪人的即所有位置雪人高度为0。给定一个整数t，表示有t(t<=5)组测试数据。每组测试数据有两个整数N(1<=N<=200000)，表示N次操作。操作分四种: U1 阅读全文

posted @ 2015-12-05 22:31 handsomecui 阅读(251) 评论(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 阅读(655) 评论(0) 推荐(0)

2015年12月4日

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 阅读(270) 评论(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 阅读(499) 评论(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 阅读(378) 评论(0) 推荐(0)

公告