
STL
文章平均质量分 84
DTL66
细节决定成败
展开
-
P - k-Multiple Free Set
P - k-Multiple Free SetTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description A k-multiple free set is a set of integers where there is no pair of int原创 2016-07-27 21:32:39 · 435 阅读 · 0 评论 -
LIGHTOJ 1410 - Consistent Verdicts【SET】
1410 - Consistent Verdicts PDF (English)StatisticsForumTime Limit: 5 second(s)Memory Limit: 32 MBIn a 2D plane N persons are standing and each of them原创 2016-11-02 13:38:30 · 295 阅读 · 0 评论 -
HDU 3938 Portal【并查集+upper_bound(第四个参数)】
PortalTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1459 Accepted Submission(s): 745Problem DescriptionZLGG found a mag原创 2016-11-13 13:38:48 · 382 阅读 · 0 评论 -
HDU 4506 小明系列故事——师兄帮帮忙【map】
小明系列故事——师兄帮帮忙Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5565 Accepted Submission(s): 1512Problem Description 小明自从告别原创 2016-10-29 00:23:50 · 529 阅读 · 0 评论 -
玲珑杯”ACM比赛 Round #4 G -- See car【Set】
玲珑杯”ACM比赛 Round #4Start Time:2016-11-05 12:00:00 End Time:2016-11-05 17:00:00 Refresh Time:2016-11-06 21:50:19 PrivateG -- See carTime Limit:2s Memory Limit:64MByteSubmissions:原创 2016-11-06 21:52:46 · 461 阅读 · 0 评论 -
Codeforces 730G. Car Repair Shop 【map】
G. Car Repair Shoptime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolycarp starts his own business. Tomorr原创 2016-10-23 23:05:38 · 849 阅读 · 0 评论 -
LIGHT OJ 1307 - Counting Triangles【二分枚举】
1307 - Counting Triangles PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are given N sticks having distinct lengths; you ha原创 2016-08-25 21:45:03 · 515 阅读 · 0 评论 -
HDU-1051 Wooden Sticks 【二维LIS(STL应用)+排序】
D - Wooden SticksTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description There is a pile of n wooden sticks. The length and weight of each stick ar原创 2016-08-12 23:12:01 · 406 阅读 · 0 评论 -
HDU-5748 Bellovin 【LIS(STL应用)】
BellovinTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1061 Accepted Submission(s): 476Problem Description Peter has a sequence a1,a2,…,原创 2016-08-12 20:49:47 · 297 阅读 · 0 评论 -
HDU-1257 最少拦截系统 【LIS转化模型(vector应用)】
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34773 Accepted Submission(s): 13735Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种原创 2016-08-12 17:53:00 · 413 阅读 · 0 评论 -
ZZULI-1912 小火山的爱情密码 【尺取(OR 二分)+map】
1912: 小火山的爱情密码Time Limit: 1 Sec Memory Limit: 128 MB Submit: 246 Solved: 64SubmitStatusWeb Board Description小火山获得了一个字符串,然而大火山让小火山从里面截取一段字符串,并且让小火山截取的字符串满足一些字符达到一定数量。 小火山觉得很容易,但是他想要知道他至少得截取多长的字符串。原创 2016-08-11 16:24:41 · 690 阅读 · 0 评论 -
POJ-3320 Jessica's Reading Problem 【尺取(or 二分)+STL】
B - Jessica’s Reading ProblemTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 3320 Description Jessica’s a very lovely girl wooed by lots of boys. R原创 2016-08-11 13:49:28 · 392 阅读 · 0 评论 -
STL学习总结
1.string : string erase函数的使用:#include <iostream>#include <string>using namespace std;int main (){ string str ("This is an example phrase."); string::iterator it; // 第(1)种用法原创 2016-08-16 00:24:41 · 259 阅读 · 0 评论 -
CodeForces 653A Bear and Three Balls 【sort+去重(unique)】
Bear and Three Ballr Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u scription:Limak is a little polar bear. He has n balls, the i-th ball has size ti.Limak wants to g原创 2016-08-22 21:48:42 · 404 阅读 · 0 评论 -
CodeForces 554B Ohana Cleans Up 【思维+map】
Ohana Cleans UpTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u DescriptionOhana Matsumae is trying to clean a room, which is divided up into an n by n grid of squares.原创 2016-08-22 21:21:48 · 321 阅读 · 0 评论 -
POJ 2259 Team Queue【模拟队列】
Team QueueTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4449 Accepted: 1541DescriptionQueues and Priority Queues are data structures which are known原创 2016-11-14 13:38:38 · 436 阅读 · 0 评论