2013年11月6日
POJ 1739 Tony's Tour（插头DP）
摘要： DescriptionA square township has been divided up into n*m(n rows and m columns) square plots (1 2 #include 3 #include 4 #include 5 using namespace std; 6 typedef long long LL; 7 8 const int MAXN = 12; 9 const int SIZEH = 13131; 10 const int MAXH = 20010; 11 12 struct hash_map { 13 i... 阅读全文
posted @ 2013-11-06 18:49 Oyking 阅读(263) 评论(0) 推荐(0)