原创 pat-top 1013. Image Segmentation (35)
https://www.patest.cn/contests/pat-t-practise/1013 這道題自己的想法是 算出一個個mst,然後看每個MST的最長邊是否可以分解。 但是沒想出好的dfs模型 後來看了http://blog
原创 pat-top 1014. Circles of Friends (35)
https://www.patest.cn/contests/pat-t-practise/1014 照抄了http://blog.csdn.net/jtjy568805874/article/details/53610228 這道題
原创 九度 oj 題目1171:C翻轉
http://ac.jobdu.com/problem.php?pid=1171 #include <cstdio> #include <algorithm> using namespace std; #define rep(i,j,k
原创 pat-top 1012. Greedy Snake (35)
https://www.patest.cn/contests/pat-t-practise/1012 參考了http://blog.csdn.net/jtjy568805874/article/details/52517821 #in
原创 九度 oj 題目1072:有多少不同的面值組合?
http://ac.jobdu.com/problem.php?pid=1072 #include <cstdio> const int n = 15; const int v = 8 * 5 + 10 * 4 + 18 * 6; co
原创 pat-top 1015. Letter-moving Game (35)
https://www.patest.cn/contests/pat-t-practise/1015 這道題開始想用bfs,但是狀態轉移和visit不好確定。 看了http://blog.csdn.net/jtjy568805874/a
原创 九度 oj 題目1073:楊輝三角形
http://ac.jobdu.com/problem.php?pid=1073 #include <cstdio> #include <cstring> #define inone(i) scanf("%d",&i) #define
原创 pat-top 1006. Tree Traversals - Hard Version (35)
https://www.patest.cn/contests/pat-t-practise/1006 code 來自於http://blog.csdn.net/jtjy568805874/article/details/50759512
原创 九度oj 題目1457:非常可樂
http://ac.jobdu.com/problem.php?pid=1457 #include <cstdio> #include <algorithm> #include <queue> #include <cstring> us
原创 pat-top 1009. Triple Inversions (35)
https://www.patest.cn/contests/pat-t-practise/1009 這道題首先用了一個簡單的dp: const int maxn = 1e5 + 2; int lar[maxn]; int a[maxn
原创 pat 1016. Phone Bills (25)
https://www.patest.cn/contests/pat-a-practise/1016 #include <cstdio> #include <algorithm> #include <map> #include <vec
原创 pat 1011 1011. World Cup Betting (20)
https://www.patest.cn/contests/pat-a-practise/1011 代碼來自 http://blog.csdn.net/jtjy568805874/article/details/50782588 #
原创 pat 1040. Longest Symmetric String (25)
https://www.patest.cn/contests/pat-a-practise/1040 參考了: https://segmentfault.com/a/1190000003914228 http://blog.csdn.n
原创 pat 1010. Radix (25)
https://www.patest.cn/contests/pat-a-practise/1010 代碼來自http://blog.csdn.net/jtjy568805874/article/details/50782565 #i
原创 pat-top 1010. Lehmer Code (35)
https://www.patest.cn/contests/pat-t-practise/1010離散化+樹狀數組code from http://