- 博客(6)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 PowerOJ 2436: STL入门 unordered_map
题目链接：点击打开链接第一次使用unordered_map，有些情况比map效率高很多，特此记录 unordered_map和map的比较：链接1，链接2我的#include #include #include #include using namespace std;int main(){ int n; while(sca
2016-03-30 17:09:23
404
原创 codeforces 653E. Bear and Forgotten Tree 2 连通问题
E. Bear and Forgotten Tree 2time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is a connected undirect
2016-03-28 19:43:05
886
原创 PowerOj 2478 最短路问题 邻接表spfa
2478: 最短路问题Time Limit:5000MS Memory Limit:65536KBTotal Submit:24 Accepted:4 Page View:387Submit Status DiscussDescription现在有n个城市，编号从1到n。现在已知从城市i到城市j需要走的时间为aij。M78要从城市1到城市n。M78有一个飞行
2016-03-26 00:50:23
579
原创 codeforces 631C Report
C. Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main economic i
2016-03-10 20:09:45
434
原创 HDU 5636 Shortest Path floyd应用
Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 643 Accepted Submission(s): 209Problem DescriptionThere is a p
2016-03-06 16:41:01
413
原创 codeforces 600A Extract Numbers 模拟
A. Extract Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Let's call word
2016-03-03 20:42:17
575
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人