8#13 - 多校7

01 - hyperspace （）

02 - building fence （计算几何，求圆和多边形的凸包，网上找的模版）

03 - finding string

04 - Mutiples on a circle (DP，环形数列DP，分类讨论拆环后有两种情况，第一种情况DP处理，第二种情况用区间查找值的优化技巧处理。对于取模的运算法则要清楚，细节注意）

06 - Backup Plan （构造，分两步，第一步考虑没有服务器坏的情况下，每台服务器active的数据库；然后依次考虑某一台服务器坏的之后，原来active的数据库平均分配到其他服务器上，优先选择active数据库少的sever）

10 - GCD of  Sequence

Hard:

05 - Cube number on a tree

07 - Present Day,Present Time

08 - 

09 - 

传送门：

SolvedPro.IDTitleAuthorSource(AC/Submit)Ratio 4666Hyperspace2013 Multi-University Training Contest 7(183/367)49.86% 4667Building Fence2013 Multi-University Training Contest 7(96/521)18.43% 4668Finding string2013 Multi-University Training Contest 7(24/78)30.77% 4669Mutiples on a circle2013 Multi-University Training Contest 7(107/449)23.83% 4670Cube number on a tree2013 Multi-University Training Contest 7(23/148)15.54% 4671Backup Plan2013 Multi-University Training Contest 7(121/272)44.49% 4672Present Day, Present Time2013 Multi-University Training Contest 7(64/134)47.76% 4673Pirate's Chest2013 Multi-University Training Contest 7(2/15)13.33% 4674Trip Advisor2013 Multi-University Training Contest 7(19/147)12.93% 4675GCD of Sequence2013 Multi-University Training Contest 7(47/162)29.01%