摘要：
https://vjudge.net/contest/66569#problem/D trick:1~N各点到X可以通过转置变为X到1~N各点 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<string> 阅读全文
摘要：
https://vjudge.net/contest/66569#problem/B 类试题：noip2013 货物运输 POJ 1797 Heavy Transportation 方法一：Dijkstra变形 http://blog.csdn.net/u013446688/article/deta 阅读全文
摘要：
https://vjudge.net/contest/66569#problem/A http://blog.csdn.net/wangjian8006/article/details/7871889 邻接矩阵实现的单源最短路 1 #include<iostream> 2 #include<cstd 阅读全文
摘要：
https://vjudge.net/contest/68966#problem/G 正解一： http://www.clanfei.com/2012/04/646.html 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 阅读全文
摘要：
https://vjudge.net/contest/68966#problem/F http://blog.csdn.net/libin56842/article/details/9048173 1 #include<iostream> 2 #include<cstdio> 3 #include< 阅读全文
摘要：
https://vjudge.net/contest/68966#problem/E http://blog.csdn.net/to_be_better/article/details/50563344 1 #include<iostream> 2 #include<cstdio> 3 #inclu 阅读全文
摘要：
https://vjudge.net/contest/68966#problem/D http://blog.csdn.net/u010489389/article/details/19218795 1 #include<iostream> 2 #include<cstdio> 3 #include 阅读全文
摘要：
https://vjudge.net/contest/68966#problem/C 【参考】http://blog.csdn.net/qinmusiyan/article/details/7986263 【题意】：多组测试数据 每组测试数据给出n个砖块的长、宽、高，每种砖块有无穷多个，可以有三种不 阅读全文
摘要：
http://www.cnblogs.com/joeylee97/p/6616039.html 1 #include<iostream> 2 #include<cstdio> 3 #include<string> 4 #include<cstring> 5 #include<cmath> 6 #in 阅读全文
摘要：
A - Max Sum Plus Plus 1 https://vjudge.net/contest/68966#problem/A 2 3 http://www.cnblogs.com/kuangbin/archive/2011/08/04/2127085.html 4 5 /* 6 状态dp[i 阅读全文