![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
STL练习
文章平均质量分 80
AnICoo1
这个作者很懒,什么都没留下…
展开
-
NYOJ 991 Registration system(map简单应用)
OK描述 A new e-mail service "Berlandesk" is going to be opened in Berland in the near future. The site administration wants to launch their project as soon as possible, that's why they ask you to help.原创 2015-06-03 07:05:03 · 1045 阅读 · 0 评论 -
hdu 5831 Rikka with Parenthesis II (可交换位置括号匹配)
Rikka with Parenthesis IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 106 Accepted Submission(s): 81Problem Description As we know, Rikk原创 2016-08-11 19:46:47 · 880 阅读 · 0 评论 -
hdu 5818 Joint Stacks (优先队列)
Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 341 Accepted Submission(s): 139Problem Description A stack is a data structure原创 2016-08-09 20:34:12 · 651 阅读 · 0 评论 -
Codeforces Round #366 (Div. 2) C. Thor (队列模拟)
C. Thortime limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputThor is getting used to the Earth. As a gift Loki gave him a smartphone. There原创 2016-08-21 14:31:43 · 514 阅读 · 0 评论 -
Codeforces Round #362 (Div. 2) C. Lorenzo Von Matterhorn (二叉树+map)
C. Lorenzo Von Matterhorn time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputBarney lives in NYC. NYC has infinite number of intersectio原创 2016-07-15 22:17:09 · 524 阅读 · 0 评论 -
UVALive 6581 What does the fox say? (模拟)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4592题意:给你几种动物的叫声,然后告诉你什么动物叫什么声音,求剩下的声音思路:直接模拟即可,将知道的动物的叫声存入set中,然后一个一个检查是否知道当前叫声ac代码:#include原创 2016-05-16 22:28:46 · 511 阅读 · 0 评论 -
POJ 3187 Backward Digit Sums (全排列)
Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5727 Accepted: 3320DescriptionFJ and his cows enjoy playing a mental game. They write原创 2016-03-16 08:26:35 · 362 阅读 · 0 评论 -
HDOJ 1755 A Number Puzzle (全排列查找)
A Number PuzzleTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1174 Accepted Submission(s): 365Problem DescriptionLele 最近上课的时候都很无原创 2016-01-10 13:43:58 · 339 阅读 · 0 评论 -
Educational Codeforces Round 6 C. Pearls in a Row (分离序列+set)
C. Pearls in a Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pearls in a row. Let's enumerate them原创 2016-01-22 23:10:06 · 777 阅读 · 0 评论 -
HDOJ 5479 Scaena Felix (栈)
Scaena FelixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 660 Accepted Submission(s): 275Problem DescriptionGiven a parentheses原创 2015-12-02 19:33:20 · 695 阅读 · 0 评论 -
ZZULIOJ 1787 生化危机 (vector+DFS)
1787: 生化危机Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 64 Solved: 19SubmitStatusWeb BoardDescriptionX博士想造福人类, 研发一种可以再生肢体的药物, 可是很不幸......研究失败了, 他在蜥蜴身上实验的时候, 蜥蜴发生了变异, 更糟糕的是, 蜥蜴逃出了原创 2015-11-22 15:30:32 · 877 阅读 · 0 评论 -
NYOJ 20吝啬的国度(vector容器+dfs||邻接表+dfs)
描述 在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据的第一行输入一个正整数N(1随后的N-1行,每行有两个正整数a,b(1输出每组测试数据输N个正整数,其中,第i个原创 2015-06-11 08:24:07 · 435 阅读 · 0 评论 -
Codeforces Round #353 (Div. 2) D. Tree Construction (二叉搜索树+set)
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputDuring the programming classes Vasya was assigned a difficult problem. However, he do原创 2016-08-24 10:31:53 · 424 阅读 · 0 评论