2014 Shanghai national invitational competition solution report, 2014 invitation Competition

2014 Shanghai national invitational competition solution report, 2014 invitation Competition

Game with Pearls

Greedy questions

Http://blog.csdn.net/u012774187/article/details/40711559

Beam Cannon

Questions about line segment tree

Http://blog.csdn.net/u012774187/article/details/40712359

Seam Carving

Simple DP

Http://blog.csdn.net/u012774187/article/details/40712899

Battle ships

Questions in the Bipartite Graph

Http://blog.csdn.net/u012774187/article/details/40713535

Maze

Pressure BFS, slightly pitfall

Http://blog.csdn.net/u012774187/article/details/40714073

Linearization of the kernel functions in SVM

Sign-in simulation questions

Http://blog.csdn.net/u012774187/article/details/40711669

ACM Rank

..

Page Rank

Pitfalls...

Smart Software Installer

Dual-queue Topology

Http://blog.csdn.net/u012774187/article/details/40736995

Comparison of Android versions

Simulation

Http://blog.csdn.net/u012774187/article/details/40712303

2014 Shanghai international soccer tournament

The competition is scheduled to take place in October June each year. We usually invite 3-4 traditional strong teams in the European, Asian, and African leagues to compete with local football clubs in Shanghai for a period of 3-4 days. All competitions were broadcast live by the five-star sports channel. Over 20 mainstream media such as Xinmin Evening News and Oriental Sports Daily reported the events.

ACM solution report

Category of a poj question
Mainstream algorithms:
1. Search // trace back
2. DP (Dynamic Planning)
3. Greedy
4. Graph Theory // Dijkstra, Minimum Spanning Tree, and network stream
5. Number Theory // solves the modulus linear equation
6. Calculate the area and perimeter of the joint of the geometric/Convex Shell with the same placement of the rectangle
7. Composite math // Polya Theorem
8. Simulation
9. Data Structure // check the collection and heap
10. Game Theory
1. Sorting
1423,169 4, 1723,172 7, 1763,178 8, 1828,183 8, 1840,220 1, 2376,
2377,238 0, 1318,187 1971,197, 1990,200 4, 2002,209 1, 2379 2,
1002 (character processing is required, and sorting can be done in a fast way) 1007 (stable sorting) 2159 (difficult to understand)
2231 2371 (simple sorting) 2388 (sequence statistics algorithm) 2418 (Binary sorting tree)
2. Search, backtracking, and traversal
2329
Simple: 1128,116 6, 1176,123 1, 1256,127 0, 1321,154 3, 1606,166 4,
1731,174 2, 1745,184, 1950,203, 2157,218 8, 2183,238 2, 2386,242 1, 6
Not easy: 1024,105 4, 1117,116 7, 1708,174 6, 1775,187 8, 1903,196 6, 2046,
2197,234 9
Recommended: 1011,119 0, 1191,141 6, 1579,163 2, 1639,165 9, 1680,168 3, 1691,
1709,171 4, 1753,1771, 1826,185 5, 1856,189 0, 1924,193 5, 1948,197 9, 1980,217 2331,233 1979, 1980 9, (similar to the maze), (higher requirements for pruning)
3. Calendar
1008 2080 (Be careful with such questions)
4. Enumeration
1387,141, 2245,232, 2363,238 1, 1650 6, (higher pruning requirements), (decimal precision problem)
5. Typical data structure Algorithms
Easy: 1182,165 6, 2021,202 3, 2051,215 3, 2227,223 6, 2247,235 2,
2395
Not easy: 1145,117 7, 1195,122 7, 1661,183 4
Recommended: 1330,133 8, 1451,147 0, 1634,168 9, 1693,170 3, 1724,198 8, 2004,
2010,211 9, 2274
1125 (fresh algorithm), 2421 (Minimum Spanning Tree of the graph)
6. Dynamic Planning
1037 A decorative fence,
1050 To the Max,
1088 skiing,
1125 Stockbroker Grapevine,
1141 Brackets Sequence,
1159 Palindrom ...... remaining full text>