参考资料:
代码强化训练
组队训练
- Summer 2017 Team Training 1
- Summer 2017 Team Training 2
- Summer 2017 Team Training 3
- Summer 2017 Team Training 4
- Summer 2017 Team Training 5
个人强化训练
综合训练
- Summer 2017 Team Professional Contest 1
- Summer 2017 Team Professional Contest 2
- Summer 2017 Team Professional Contest 3
字符串参考资料
1、从头到尾彻底理解KMP
http://www.cnblogs.com/zhangtianq/p/5839909.html2、最长回文子串
http://blog.csdn.net/kangroger/article/details/37742633、AC自动机最详细的讲解,让你一次学会AC自动机
http://blog.csdn.net/creatorx/article/details/711008404、后缀数组
http://www.cnblogs.com/shanchuan04/p/5324009.html
http://blog.csdn.net/fp_hzq/article/details/8990932
数学参考资料
1、素数有关算法
http://blog.csdn.net/snow_me/article/details/525888192、扩展欧几里德算法
http://blog.csdn.net/zhjchengfeng5/article/details/77865953、逆元
http://blog.csdn.net/acdreamers/article/details/82207874、Miller_rabin算法
http://blog.csdn.net/maxichu/article/details/454585695、欧拉函数
http://blog.csdn.net/sentimental_dog/article/details/520026086、模线性方程组
http://blog.csdn.net/qq_21120027/article/details/513402187、高斯消元法
http://blog.csdn.net/duanxian0621/article/details/74088878、FFT(快速傅氏变换)
http://www.gatevin.moe/acm/fft%E7%AE%97%E6%B3%95%E5%AD%A6%E4%B9%A0%E7%AC%94%E8%AE%B0/9、莫比乌斯反演
http://blog.csdn.net/acdreamers/article/details/854229210、离散对数(Baby Step Giant Step)
http://blog.csdn.net/acdreamers/article/details/8579511
数据结构参考资料
1、划分树
http://blog.csdn.net/shiqi_614/article/details/80413902、主席树
http://blog.csdn.net/sprintfwater/article/details/91620413、区间最值查询(RMQ)
http://blog.csdn.net/liang5630/article/details/7917702
http://blog.csdn.net/metalseed/article/details/79532604、树链剖分原理
http://blog.csdn.net/acdreamers/article/details/105914435、树状数组
http://blog.csdn.net/ljd4305/article/details/101015356、线段树
http://www.cnblogs.com/TenosDoIt/p/3453089.html7、Splay Tree(伸展树)
http://blog.csdn.net/niuox/article/details/80182808、动态树
http://blog.csdn.net/d891320478/article/details/91813859、主席树
http://blog.csdn.net/sprintfwater/article/details/9162041
图论参考资料
1、最短路:Dijkstra算法
http://www.cnblogs.com/skywang12345/p/3711512.html2、最短路:Bellman-Ford算法
http://blog.csdn.net/niushuai666/article/details/67917653、最短路:SPFA算法
http://www.layz.net/LAOJ/suanfa/s9-4.html4、最小生成树:Kruskal算法 >http://blog.csdn.net/luomingjun12315/article/details/47700237
5、最小生成树:Prim算法
http://blog.csdn.net/yeruby/article/details/386150456、次小生成树
http://yzmduncan.iteye.com/blog/10183587、有向图的强连通分量:Tarjan算法
http://www.cnblogs.com/uncle-lu/p/5876729.html8、有向图的强连通分量:Kosaraju算法
http://www.cnblogs.com/nullzx/p/6437926.html9、最小树形图
http://www.cnblogs.com/Ash-ly/p/5536796.html10、二分图
http://dsqiu.iteye.com/blog/1689505
http://www.renfei.org/blog/bipartite-matching.html11、二分图最大匹配:匈牙利算法
http://blog.csdn.net/dark_scope/article/details/8880547
http://www.cnblogs.com/pony1993/archive/2012/07/25/2607738.html12、二分图最大匹配:Hopcroft-Karp算法
http://blog.csdn.net/wall_f/article/details/824837313、生成树计数:Matrix-Tree定理
http://blog.csdn.net/longshuai0821/article/details/776426714、二分图多重匹配问题
http://blog.csdn.net/u014427196/article/details/4831963915、二分图最大权匹配:Kuhn-Munkres算法
http://www.cnblogs.com/kuangbin/archive/2012/08/19/2646535.html16、最大流问题
http://blog.csdn.net/yiqingnian28/article/details/23388633
http://www.cnblogs.com/kuangbin/archive/2011/07/26/2117636.html17、最小费用最大流
http://blog.csdn.net/stillxjy/article/details/5204718918、2-SAT
http://blog.csdn.net/jarjingx/article/details/852169019、曼哈顿距离最小生成树
http://blog.csdn.net/acm_cxlove/article/details/889000320、莫队算法
http://blog.csdn.net/hzj1054689699/article/details/5186661521、一般图匹配问题:带花树
http://blog.csdn.net/u014261987/article/details/41350003
http://blog.csdn.net/jackyguo1992/article/details/1127149722、LCA(最近公共祖先)
http://blog.csdn.net/liangzhaoyang1/article/details/52549822
http://www.cnblogs.com/wuminye/p/3527176.html
http://blog.csdn.net/Janis_z/article/details/52937631?locationNum=6&fps=1
计算几何参考资料
>1、计算几何 >其他-参考资料
>1、动态规划 >7-20 代码强化训练1 《葵花宝典》P3-24
A - Cow Patterns 来源:POJ – 3167 知识点:扩展KMP等 [http://blog.csdn.net/tmeteorj/article/details/8693366](http://blog.csdn.net/tmeteorj/article/details/8693366) [http://www.cppblog.com/zxb/archive/2010/10/06/128782.aspx?opt=admin](http://www.cppblog.com/zxb/archive/2010/10/06/128782.aspx?opt=admin)B - Best Sequence
来源:POJ – 1699
知识点:扩展KMP+DFS等
http://blog.csdn.net/zzzz40/article/details/39186109
C – Palindrome
来源:POJ – 3974
知识点:Manacher算法等
http://blog.csdn.net/u010885899/article/details/45366633
http://blog.csdn.net/geniusluzh/article/details/8639759
D - Keywords Search
来源:HDU – 2222
知识点:AC自动机等
http://blog.csdn.net/hnust_xiehonghao/article/details/9130539
E - Longest Common Substring
来源:HDU – 1403
知识点:后缀数组DA算法(倍增算法)等
http://blog.csdn.net/xinag578/article/details/50164599
F - Power Strings
来源:POJ – 2406
知识点:后缀数组DC3算法等
http://blog.csdn.net/libin56842/article/details/46310425
G – String
来源:CodeForces - 123D
知识点:后缀自动机(SAM)等
http://blog.csdn.net/dyx404514/article/details/8713542
http://www.hankcs.com/program/algorithm/codeforces-123d-string.html
H - Prime Distance
来源:POJ – 2689
知识点:大区间素数筛选等
http://www.cnblogs.com/kuangbin/archive/2013/05/20/3089840.html
I - The Factor
来源:HDU – 5428
知识点:素数筛选合数分解等
http://www.bubuko.com/infodetail-1079772.html
http://www.cnblogs.com/Apro/p/4784808.html
J - A/B
来源:HDU - 1576
知识点:扩展欧几里得算法等
http://blog.csdn.net/ljd4305/article/details/26057385
http://blog.csdn.net/lyc1635566ty/article/details/50611246
K - X问题
来源:HDU - 1573
知识点:解一元线性同余方程组、中国剩余定理等
http://www.cnblogs.com/zhangmingcheng/p/4238407.html
http://blog.csdn.net/a601025382s/article/details/10296577
L - Prime Test
来源:POJ – 1811
知识点:大素数判断和素因子分解等
http://www.cnblogs.com/kuangbin/archive/2012/08/19/2646404.html
M - Farey Sequence
来源:POJ – 2478
知识点:欧拉函数等
http://blog.csdn.net/aaaaacmer/article/details/47272037
7-21 代码强化训练2 《葵花宝典》P24-42
A - Kind of a Blur
来源:HDU - 3359
知识点:高斯消元法等
http://blog.csdn.net/qwb492859377/article/details/47013321
B - A * B Problem Plus
来源:HDU – 1402
知识点:FFT、大整数乘法等
http://blog.csdn.net/sdj222555/article/details/9786527
C - 3-idiots
来源:HDU – 4609
知识点:FFT计数等
http://blog.csdn.net/qq_33184171/article/details/54427994
D - Painter’s Problem
来源:POJ – 1681
知识点:高斯消元法(一类开关问题,对2取模的01方程组)等
http://www.cnblogs.com/kuangbin/archive/2012/08/31/2665913.html
E - Widget Factory
来源:POJ – 2947
知识点:高斯消元法(解同余方程组)等
http://www.cnblogs.com/gj-Acit/p/3903085.html
F - Partition
来源:HDU – 4651
知识点:整数拆分等
http://www.cnblogs.com/zhsl/archive/2013/08/07/3242268.html
G - Integer Partition
来源:HDU – 4658
知识点:整数划分、生成函数等
http://blog.csdn.net/a601025382s/article/details/10299367
H - Sumdiv
来源:POJ – 1845
知识点:求A^B的约数之和对MOD取模等
http://www.cnblogs.com/kuangbin/archive/2012/08/10/2631225.html
I - GCD
来源:HDU – 1695
知识点:莫比乌斯反演等
http://blog.csdn.net/lixuepeng_001/article/details/50577932
J - Discrete Logging
来源:POJ – 2417
知识点:离散对数(Baby Step Giant Step)等
http://www.cnblogs.com/kuangbin/archive/2013/08/24/3278852.html
K - K-th Number
来源:POJ – 2104
知识点:经典划分树、主席树等
http://blog.csdn.net/pure_lady/article/details/46806833
http://www.cnblogs.com/oyking/p/3230296.html
L - Sliding Window
来源:POJ – 2823
知识点:单调队列、线段树、一维RMQ等
http://blog.csdn.net/u013351484/article/details/45112271
M – Cornfields
来源:POJ – 2019
知识点:二维RMQ等
http://www.cnblogs.com/kuangbin/p/3227420.html
7-23 代码强化训练3 《葵花宝典》P43-74
A - Aragorn’s Story
来源: HDU – 3966
知识点:树链剖分+树状数组等
http://www.cnblogs.com/kuangbin/archive/2013/08/14/3258736.html
B - Query on a tree
来源: SPOJ – QTREE
知识点:树链剖分+线段树等
http://blog.csdn.net/niuox/article/details/8145842
C - SuperMemo
来源:POJ – 3580
知识点:Splay Tree(伸展树)等
http://blog.csdn.net/jasonzhu8/article/details/5747811
D - Query on The Trees
来源:HDU – 4010
知识点:动态树等
http://www.cnblogs.com/kuangbin/archive/2013/09/04/3300251.html
E - D-query
来源:SPOJ - DQUERY
知识点:主席树-区间不同数的个数 等
http://blog.csdn.net/aozil_yang/article/details/65448883
F - K-th Number
来源:POJ – 2104
知识点:主席树-静态区间第k大 等
http://www.cnblogs.com/kuangbin/archive/2013/09/05/3302731.html
G - Count on a tree
来源:SPOJ – COT
知识点:LCA+主席树等
http://blog.csdn.net/acm_cxlove/article/details/8564167
http://www.cnblogs.com/arbitrary/archive/2013/10/09/3360104.html
H - Dynamic Rankings
来源: ZOJ - 2112
知识点:树状数组+主席树-动态第k大等
http://www.cnblogs.com/kuangbin/p/3308118.html
I - MPI Maelstrom
来源:POJ – 1502
知识点:Dijkstra算法等
http://blog.csdn.net/u013446688/article/details/42708487
J - Invitation Cards
来源:POJ – 1511
知识点:优先队列优化的Dijkstra算法等
http://www.cnblogs.com/kuangbin/p/3140958.html
K - Currency Exchange
来源:POJ – 1860
知识点:Bellman-Ford算法等
http://www.cnblogs.com/kuangbin/archive/2012/08/17/2644807.html
L - Wormholes
来源:POJ - 3259
知识点:SPFA等
http://blog.csdn.net/murmured/article/details/18669909
M - Highways
来源:POJ – 2485
知识点:最小生成树等
http://blog.csdn.net/mikasa3/article/details/51559191
http://blog.csdn.net/fanesemyk/article/details/51137466?locationNum=1&fps=1
N - Design Tutorial: Inverse the Problem
来源:CodeForces - 472D
知识点:最小生成树等
http://blog.csdn.net/u010660276/article/details/39901287
O - Qin Shi Huang’s National Road System
来源:HDU - 4081
知识点:次小生成树等
http://blog.csdn.net/shuangde800/article/details/7982106
7-24 代码强化训练4 《葵花宝典》P74-96
A - Popular Cows
来源:POJ – 2186
知识点:Tarjan算法等
http://www.dontcry-tat.com/2017/04/26/poj-2186-popular-cows/
B - 迷宫城堡
来源:HDU – 1269
知识点:Kosaraju算法等
http://blog.csdn.net/qq7366020/article/details/12943345
C - Critical Links
来源:UVA – 796
知识点:无向图求桥等
http://www.cnblogs.com/chenchengxun/p/4718717.html
D - Electricity
来源:POJ – 2117
知识点:无向图求割点
http://blog.csdn.net/liwen_7/article/details/7919220
E - Redundant Paths
来源:POJ – 3177
知识点:无向图的双连通问题等
http://mojijs.com/2014/11/165169/index.html
F - Knights of the Round Table
来源:POJ – 2942
知识点:点的双连通分量等
http://www.cnblogs.com/wangfang20/p/3201502.html
G - Command Network
来源:POJ – 3164
知识点:最小树形图等
http://blog.csdn.net/shuangde800/article/details/8039359
H - The Perfect Stall
来源:POJ – 1274
知识点:二分图最大匹配:匈牙利算法
http://blog.csdn.net/u013487051/article/details/37656979
I - Asteroids
来源:POJ – 3041
知识点:二分图最大匹配:匈牙利算法
http://blog.csdn.net/yeruby/article/details/39315713
J - COURSES
来源:POJ – 1469
知识点:二分图最大匹配:Hopcroft-Karp算法
http://blog.csdn.net/u011466175/article/details/23709885
K - Lightning
来源:HDU – 4305
知识点:生成树计数:Matrix-Tree定理
http://blog.csdn.net/julyana_lin/article/details/8067024
L - Highways
来源:SPOJ – HIGH
知识点:生成树计数
http://blog.csdn.net/gatevin/article/details/48051879
M - Alice’s Chance
来源:POJ – 1698
知识点:二分图多重匹配
http://blog.csdn.net/l123012013048/article/details/47295503
N - 奔小康赚大钱
来源:HDU – 2255
知识点:二分图最大权匹配、KM算法等
http://blog.csdn.net/sr_19930829/article/details/40650359
7-26 代码强化训练5 《葵花宝典》P96-121
A - Dual Core CPU
来源:POJ - 3469
知识点:网络流:SAP算法等
http://blog.csdn.net/discreeter/article/details/51591775
B - Drainage Ditches
来源:POJ - 1273
知识点:网络流:ISAP算法等
http://blog.csdn.net/lianai911/article/details/44964361
C - Island Transport
来源:HDU - 4280
知识点:网络流:ISAP算法、Dinic等
http://blog.csdn.net/wubaizhe/article/details/74046372
D - Minimum Cost
来源:POJ - 2516
知识点:最小费用最大流等
http://blog.csdn.net/lyy289065406/article/details/6742534
http://blog.csdn.net/u014552756/article/details/49977887
E - Peaceful Commission
来源:HDU - 1814
知识点:2-SAT等
http://m.blog.csdn.net/EzCUfST/article/details/47008027
F - Wedding
来源:POJ - 3648
知识点:2-SAT等
http://blog.csdn.net/sdj222555/article/details/7718821
G - Object Clustering
来源:POJ - 3241
知识点:莫队算法、曼哈顿最小生成树等
http://www.cnblogs.com/mfrbuaa/p/5375000.html
H - Work Scheduling
来源:URAL - 1099
知识点:一般图匹配带花树等
http://blog.csdn.net/u010660276/article/details/48013013
I - Nearest Common Ancestors
来源:POJ - 1330
知识点:LCA:dft+ST在线算法等
http://www.cnblogs.com/kuangbin/archive/2013/09/05/3302493.html
J - Closest Common Ancestors
来源:POJ - 1470
知识点:LCA:离线Tarjan算法等
http://www.cnblogs.com/kuangbin/p/3302571.html
K - The merchant
来源:POJ - 3728
知识点:LCA:倍增法等
http://blog.csdn.net/lanshui_yang/article/details/11746513
L - Intersecting Lines
来源:POJ - 1269
知识点:判断线段相交等
http://blog.csdn.net/acdreamers/article/details/8811201
M - Segments
来源:POJ - 3304
知识点:直线和线段相交判断等
http://www.cnblogs.com/kuangbin/p/3188863.html
N - The Doors
来源:POJ - 1556
知识点:线段交+最短路等
http://www.cnblogs.com/kuangbin/p/3189309.html
O - Area
来源:POJ – 1654
知识点:求多边形面积等
http://www.cnblogs.com/lv-2012/archive/2012/12/01/2797264.html
7-28 代码强化训练6 《葵花宝典》P121-152
A - Card
来源:HDU - 4350
知识点:模拟等
http://blog.csdn.net/wconvey/article/details/7848235
B - A Round Peg in a Ground Hole
来源:POJ - 1584
知识点:判断凸多边形、判断点在多边形内、判断圆在多边形内等
http://www.cnblogs.com/liuxin13/p/4799667.html
C - Cupid’s Arrow
来源:HDU - 1756
知识点:判断点在多边形内外等
http://blog.csdn.net/lttree/article/details/24301607
D - Shape of HDU
来源:HDU - 2108
知识点:判断凸多边形等
http://blog.csdn.net/lttree/article/details/24241987
E - Wall
来源:HDU - 1348
知识点:求凸包周长等
http://blog.csdn.net/W1413882708/article/details/52191385
F - Quoit Design
来源:HDU - 1007
知识点:查找平面最近点对等
http://blog.csdn.net/sun1956/article/details/8294048
G - Beauty Contest
来源:POJ - 2187
知识点:求解平面最远点对等
http://blog.csdn.net/crazy_ac/article/details/10082403
H - Triangle
来源:ZOJ - 2419
知识点:求解平面点集最大三角形等
http://blog.csdn.net/zxy_snow/article/details/6595123
I - The widest road
来源:HDU - 2823
知识点:求解两凸包最小距离等
http://blog.csdn.net/clover_hxy/article/details/54022026
J - Art Gallery
来源:ZOJ- 1369
知识点:半平面交等
http://blog.csdn.net/l04205613/article/details/6626844
K - Kindergarten Electiond
来源:ZOJ-3715
知识点:枚举、贪心等
http://blog.csdn.net/zy691357966/article/details/44853449
L - Attack on Titans
来源:ZOJ-3747
知识点:递推等
http://blog.csdn.net/summer__show_/article/details/70243332
M - Alignment
来源:HDU - 1950
知识点:最长上升子序列等
http://www.cnblogs.com/blueprintf/p/5773393.html
http://blog.csdn.net/wall_f/article/details/8295812
N - Game of Connections
来源:HDU - 1134
知识点:卡特兰数等
http://blog.csdn.net/u013509299/article/details/19758565
O - Group
来源:HDU 4638
知识点:莫队算法、离线线段树等
http://blog.csdn.net/xlzhang223/article/details/51439180
P - Count on a tree II
来源:SPOJ - COT2
知识点:树上的莫队算法、树上区间查询等
http://blog.csdn.net/htt_h/article/details/47729479
7-30 Summer 2017 Team Training 1
A-zoj 3878 Convert QWERTY to Dvorak 暴力
http://blog.csdn.net/loy_184548/article/details/50592408
B-codeforces 765E Tree Folding 拓扑排序
http://blog.csdn.net/hjt_fathomless/article/details/56013633
C-Gym 101063K Dire, Dire Docks 构造
D-hdu 5875 Function 二分+rmq
http://blog.csdn.net/miracle_ma/article/details/52504922
E-poj 3244 Difference between Triplets 数学公式推导
http://blog.csdn.net/acdreamers/article/details/12236319
F-hdu 5724 Chess 博弈+sg函数
http://blog.csdn.net/Danliwoo/article/details/51968789
G-gym 101156L Super 2048 模拟
H-hdu 6031Innumerable Ancestors 二分+lca
http://blog.csdn.net/oranges_c/article/details/71698555
I-hdu 1538 A Puzzle for Pirates 经典的海盗分金推理
http://blog.csdn.net/acm_cxlove/article/details/7853916
J-hdu 5791 Two dp
http://blog.csdn.net/s_black/article/details/52102668
7-31 Summer 2017 Team Training 2
A.Coins 贪心
http://www.cnblogs.com/autsky-jadek/p/7226706.html?utm_source=itdadao&utm_medium=referral
B.Business Cycle 贪心、二分
http://www.cnblogs.com/shimu/p/5948176.html
C.Triangle Formation 水题
http://blog.csdn.net/code12hour/article/details/51990060
D.Powerful array 莫队算法
http://blog.csdn.net/zearot/article/details/50835130
E.Profact 暴搜、剪枝(STL)
http://blog.csdn.net/lmhacm/article/details/61416851
F.Kevin’s Problem 组合数学
http://mcginn.lofter.com/post/1d50332c_7f59909
G.Sequence Value Dp
https://media.hihocoder.com/contests/challenge29/sol.pdf
http://blog.csdn.net/werkeytom_ftd/article/details/73740771
H.Snakes capturing the Mongoose Cities 树形dp
https://discuss.codechef.com/questions/100120/captciti-editorial
I.Robot Racing
http://blog.csdn.net/KEYboarderQQ/article/details/57135492
J.codechef SNGRAPH 简单图论
https://discuss.codechef.com/questions/99946/sngraph-editorial
8-4 Summer 2017 Team Training 3
A.OO’s Sequence 约数枚举
http://blog.csdn.net/maxichu/article/details/47611819
B.LRU 概率+状态压缩DP
http://blog.csdn.net/clove_unique/article/details/62233833
C.Devu and Flowers 组合数学+容斥
http://hzwer.com/3810.html
D.Just a Hook 线段树区间更新
http://blog.csdn.net/libin56842/article/details/13511181
E.The Frog’s Games 二分+贪心
http://blog.csdn.net/non_cease/article/details/6769814
F.A Simple Math Problem 矩阵快速幂
http://blog.csdn.net/efreet9539/article/details/24538071
G.翻纸牌游戏 DFS
http://blog.csdn.net/libin56842/article/details/14104989
H.Unlucky Strings 快速幂+KMP
http://blog.csdn.net/u014664226/article/details/49110349
I.Get Out! 计算几何
http://blog.csdn.net/diary_yang/article/details/13880547
J.Cracking’ RSA 高斯消元
http://blog.csdn.net/ok_again/article/details/13776037
8-6 Summer 2017 Team Training 4
A. LCM from 1 to n 节省空间的素数筛法
http://blog.csdn.net/whyorwhnt/article/details/9397289
B. Antiarithmetic? 枚举等差数列
http://blog.csdn.net/keshuai19940722/article/details/18803443
C. What a Ridiculous Election bfs预处理
http://blog.csdn.net/keyboardmagician/article/details/53246315
D. Jogging Trails 欧拉回路+状压DP
http://blog.csdn.net/no__stop/article/details/16943929
E. Pocky 凑数
http://www.oyohyee.com/post/HDU/5984.html
F. Alice and Bob 博弈找规律
http://m.blog.csdn.net/xlzhang223/article/details/51755303
G. zxa and leaf 二分+dfs
http://blog.csdn.net/hjt_fathomless/article/details/51413061
H. 连接的管道
http://www.bubuko.com/infodetail-1044544.html
I. Caocao’s Bridges
http://blog.csdn.net/mengzhengnan/article/details/11856435
J . Communication System
http://www.cnblogs.com/nicetomeetu/p/5152291.html
8-7 Summer 2017 Team Training 5
A题 hdu 5819 概率dp
http://blog.csdn.net/v5zsq/article/details/52372939
B题 poj2706 模拟+BFS
http://blog.csdn.net/lyy289065406/article/details/6648663
C题 poj 1085 博弈+极大极小搜索,剪枝
http://blog.csdn.net/acm_cxlove/article/details/7997246
D题 zoj 1919 欧拉路径的输出
http://blog.csdn.net/axuan_k/article/details/45844491
E题 hdu 3094 博弈sg函数
http://blog.csdn.net/Vmurder/article/details/42653129
F题 zoj 1101 二分
http://blog.csdn.net/forever_wjs/article/details/51493515
G题 poj 3904 容斥原理,莫比乌斯反演
http://blog.csdn.net/lianai911/article/details/47609075
H题 poj 1472 栈模拟
http://blog.csdn.net/lyy289065406/article/details/6648640
8-2 Summer 2017 Individual Training 1
A-hdu 2095 find your present(2) 异或
http://blog.csdn.net/dgq8211/article/details/7455722
B-hdu 4869 Turn the pokers 组合数
http://blog.csdn.net/dyx404514/article/details/38239155
C-hdu 5592 ZYB’s Premutation 线段树或树状数组
http://blog.csdn.net/lljjccsskk/article/details/50215631
D-hdu 5636 Shortest Path Floyd+暴力
http://blog.csdn.net/liuke19950717/article/details/50923293
E-hdu 3038 How Many Answers Are Wrong 并查集
http://blog.csdn.net/backforward/article/details/51889011
F-poj 3318 Matrix Multiplication 随机化
http://blog.csdn.net/sr_19930829/article/details/38236769
G-Codeforces 739B Alyona and a tree dfs + 二分
http://blog.csdn.net/harlow_cheng/article/details/53687480
H-csu 1473 递增子序列 离散化+树状数组
I-hdu 5742 It’s All In The Mind 贪心
http://blog.csdn.net/helloiamclh/article/details/52002580
J-UVA 11210 Chinese Mahjong 暴力搜索
http://blog.csdn.net/keshuai19940722/article/details/10034505
8-9 Summer 2017 Individual Training 2
A - 渐变字符串 UESTC - 1510 贪心水题
http://blog.csdn.net/wyk1823376647/article/details/66478566
B - PolandBall and Game CodeForces - 755B 博弈水题
http://www.cnblogs.com/tyty-Somnuspoppy/p/6294030.html
C - Rikka with Tree HihoCoder - 1453 动态规划
http://blog.csdn.net/qq_28954601/article/details/53872423
D - 神秘组织的的分数 UESTC - 1707 数学爆搜
http://blog.csdn.net/Tribleave/article/details/77070964
E - Fast Multiplication HihoCoder - 1527 贪心或动态规划
http://blog.csdn.net/f_zyj/article/details/73754452
F - 完美数 51Nod - 1232 数论 数位dp
http://blog.csdn.net/u010885899/article/details/51264468
G - Non-Decreasing Sequence HihoCoder - 1529 优先队列和函数构造
https://media.hihocoder.com/contests/challenge29/sol.pdf
http://blog.csdn.net/u014609452/article/details/73740861
H - 找朋友 51Nod - 1463 线段树
http://blog.csdn.net/u010885899/article/details/50211737
http://blog.csdn.net/doyouseeman/article/details/53815828
I - Word Puzzles POJ - 1204 字典树 AC自动机
http://blog.csdn.net/u013588639/article/details/38406283
http://blog.csdn.net/dan__ge/article/details/51427825
8-21 Summer 2017 Team Professional Contest 1
题目来源:
JAG Practice Contest for ACM-ICPC Asia Regional 2016
http://jag2016autumn.contest.atcoder.jp/assignments
题解参考:
https://post.icpc-camp.org/d/581-jag-practice-contest-for-acm-icpc-asia-regional-2016-hints
8-23 Summer 2017 Team Professional Contest 2
题目来源:
2015 ACM-ICPC Asia EC-Final Contest
http://acmicpc.info/wp-content/uploads/2015/12/ecfinal_problems.pdf
题解参考:
http://www.cnblogs.com/clrs97/p/6136032.html
8-25 Summer 2017 Team Professional Contest 3
题目来源:KTU camp DAY1
题解:Analysis.pptx