相关阅读
相关 pku 3176 水
\include <iostream> \include <cstdio> \include <cstring> using namespace std; int map\[3
我不是女神ヾ相关 pku 1887 Test The CATCHER
\include <iostream> \include <algorithm> using namespace std; int map\[10005\]; int MaxL
我会带着你远行相关 pku 3356 AGTC
\include <iostream> \include <string> using namespace std; int v\[1001\]\[1001\]; int ma
相关 pku 1088 滑雪
\include <iostream> using namespace std; int map\[100\]\[100\]; int v\[100\]\[100\]; int
相关 pku 1101 bfs
/\ //很很很经典的bfs, 这也是我第一次正式用bfs来刷题, 感受颇深: //one.cpp是用bfs来解决从一个点到另一个点的最短路程长度的方法(写的有点冗杂) 注意的
向右看齐相关 pku 1146 dfs
\include <iostream> using namespace std; \define MAX 52 int map\[MAX\]\[MAX\]; bool visi
我就是我相关 pku 3267 The Cow Lexicon
\include <iostream> \include <string> using namespace std; int v\[302\]; char s\[600\]\[
相关 poj-1887Testing the CATCHER（LIS变形）
Testing the CATCHER <table> <tbody> <tr> <td><strong>Time Limit:</strong> 
分手后的思念是犯贱相关 pku 1634 Who's the boss? stl排序+二分查找
\include <iostream> \include <algorithm> \include <vector> using namespace std; struct P
相关 pku 1456 Supermarket
\include <iostream> \include <cstdio> \include <algorithm> using namespace std; \define
还没有评论，来说两句吧...