数据结构
Byte__
ACM成长中。
展开
-
Codeforces Round #296 (Div. 2) C. Glass Carving
C. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeonid wants to become a glass carver (the原创 2015-03-18 11:39:31 · 931 阅读 · 0 评论 -
POJ3468 A Simple Problem with Integers 线段树成段更新
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 89719 Accepted: 27930Case Time Limit: 2000MSDescriptionYou have N原创 2016-05-17 21:11:31 · 393 阅读 · 0 评论 -
HDU1166 敌兵布阵 线段树 入门
,还有什么途径可以申请加入ACM校队? 敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 71311 Accepted Submission(s): 29895Problem De原创 2016-05-10 17:20:36 · 840 阅读 · 0 评论 -
HDU1754 I Hate It 线段树 单点更新
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 60417 Accepted Submission(s): 23517Problem Description很多学校流行一种比较的习惯。原创 2016-05-10 17:19:10 · 704 阅读 · 0 评论 -
ZOJ2339 Hyperhuffman 优先队列
HyperhuffmanTime Limit: 5 Seconds Memory Limit: 32768 KBYou might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the cod原创 2016-03-19 17:32:31 · 440 阅读 · 0 评论 -
POJ2299 Ultra-QuickSort 归并排序求逆序对
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 51777 Accepted: 19009DescriptionIn this problem, you have to analyze a particular sorti原创 2016-03-05 21:28:25 · 509 阅读 · 0 评论 -
ZOJ 3574 Under Attack II 归并排序求逆序对
Under Attack IITime Limit: 5 Seconds Memory Limit: 65536 KB Because of the sucessfully calculation in Under Attack I, Doctor is awarded with Courage Cross and promoted to lieutenant.原创 2015-07-31 10:35:34 · 132 阅读 · 0 评论 -
hdu 3738 The Sweat Shop 单调栈加贪心思想
The Sweat ShopTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 28Problem DescriptionMany people spe原创 2015-08-25 09:50:18 · 885 阅读 · 0 评论 -
猴子向右看,FOJ上某题 单调栈
N (1 i (1 i Each monkey is looking to his left toward those with higher index numbers. We say that monkey i "looks up" to monkey j if i ij. For each monkey i, we would like to know the index of th原创 2015-07-06 19:09:10 · 686 阅读 · 1 评论 -
POJ 3250 Bad Hair Day 模拟单调栈
Bad Hair DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14989 Accepted: 4977DescriptionSome of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a原创 2015-07-06 19:47:18 · 129 阅读 · 1 评论 -
POJ 3349 Snowflake Snow Snowflakes
Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 33415 Accepted: 8766DescriptionYou may have heard that no two snowflakes are原创 2015-05-27 21:40:50 · 652 阅读 · 0 评论 -
POJ 1028 Web Navigation
Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30689 Accepted: 13750DescriptionStandard web browsers contain features to move backward原创 2015-05-11 20:14:03 · 770 阅读 · 0 评论 -
POJ 1363 Rails
There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to e原创 2015-04-13 23:43:22 · 555 阅读 · 0 评论 -
UVA11988 Broken Keyboard (a.k.a. Beiju Text)
看到大一练习题,睡前水一水~~~Problem BBroken Keyboard (a.k.a. Beiju Text)You're typing a long text with a broken keyboard. Well it's not so badly broken. The only problem with the keyboard is that原创 2015-04-13 23:47:59 · 997 阅读 · 0 评论 -
哈夫曼树
1002: 哈夫曼树Time Limit: 1 Sec Memory Limit: 65535 MB 64bit IO Format: %lldSubmitted: 13 Accepted: 6[Submit][Status][Web Board]Description根据给定的若干权值可以构造出一颗哈夫曼树。构造的哈夫曼树可能不唯一,但是按照下面的选取原原创 2017-04-07 16:17:30 · 1012 阅读 · 0 评论