Category 2 of PKU questions written by Daniel

Source: Internet
Author: User
Version 2
Algorithm entry (simple question)
1000 1003 1004 1005 1006 1007 1015 (DP) 1016 10171018 1042 (DP) 1046 (simple mathematics) 1054 (simple pruning) 1062 (DP) 1068
1095 1113 (convex hull, but small scale, O (N ^ 2) 1125 1127 1152
1183 (calculated by pen) 1218 1221 1244 1281 1312 1313 (search for regular expressions)
1315 () 1321 (same as 1315) 1323 (DP) 1326 1331 1491
1493 (regular search) 1503 (High Precision) 1504 1517 1519 1547 1552
1563 (take a closer look and pay attention to accuracy) 1650 (not a good question) 1651 (DP) 1656
1657 1658 1663 1675 (Computational ry) 1681 1702 (tridecimal operation) 1799
1828 1862 (simple mathematics) 1887 1906 (practical practice) 1914 1915 (wide search)
1928 1936 1978 1979 2000 2019 (DP good question) 2027 (SPAM question) 2028
2078 (do not repeat the search) 2080 2081 2083 2140 2141 2184 (Active DP)
2190 2192 2193 2196 2199 2209 2211 2243 2248 (Search)
2260 2261 2262 2291 2301 2304 2309 (regular search) 2316 2317
2318 2325 2355 2357 2363 2378 (tree DP) 2381 2385 2393
2394 2395 2413 (High Precision basis) 2418 2419

Classic
1011 (search for good questions)
1012 (learn to create tables)
1013
1019 (it reflects the characteristics of many such problems)
1050 (absolutely classic DP)
1088 (DP)
1157 (flower shop, classic DP)
1163 (why is there so much classic DP ???)
1328 (Greedy)
1458 (longest common subsequence)
1647 (good real questions, accurate on-site analysis and quick start)
1654 (learning the Triangle Method of Polygon Area)
1655 (a non-root tree DP problem)
1804 (Reverse Order)
2084 (typical mathematical questions)
2187 (use a convex bag to find the farthest point. After finding the convex bag, there should be an O (n) method, but I just cannot tune it out)
2195 (optimal matching of bipartite images)
2242 (Computational geometric classic)
2295 (Equality processing)
2353 (DP, but the best path should be recorded)
2354 (three-dimensional analytic ry)
2362 (search for good questions)
2410 (Reading questions is the key)
2411 (Classic DP)

Fun
1067 (difficult mathematics, but careful research is a broad field)
1147 (an algorithm with O (n) needs to be considered)
1240 (until the first and last traversal of a tree, what kind of middle traversal? DP)
1426 (is it number theory? The error is graph theory !)
1648 (do not use computational ry. Use the whole point feature to bypass the obstacle of precision)
1833 (finding Rules)
1844 (it seems like DP or search is actually an interesting mathematical problem)
1922 (greedy, haha)
2231
2305 (high precision is not required)
2328 (please be careful)
2356 (number theory knowledge)
2359 (Joseph problem variant)
2392 (interesting question)

Very complex questions
1001
1008
1087 (the diagram is annoying, and there is also the maximum matching of the Bipartite Graph)
1128 (usaco)
1245
1329
1550 (reading and comprehension)
1649 (DP)
2200 (string processing + enumeration)
2358 (enumeration and avoiding repetition are annoying)
2361 (carefully and carefully)

Difficulties
1014 (it is difficult to prove mathematics, but it is more important to have that idea)
1037 (relatively difficult DP)
1405 (high-precision algorithms are classified into different levels. Keep improving)
2002 (I don't know if there are any more algorithms than O (N ^ 2 * logn ?)
2054 (extremely difficult, strong thinking ability)
2085 (combined mathematics)
2414 (DP, but pruning required)
2415 (Search)
2423 (calculation ry + statistics)

Multi-Solution
1002 (sorting or statistics can be used)
1338 (both search and DP are supported)
1664 (search and DP Practice)
2082 (this is my question)
2352 (both bucket and Binary Trees)

Maximum stream:
1087 a plug for Unix
1149 pigs
1273 drainage ditches
1274 the perfect stall
1325 Machine Schedule
1459 Power Network
2239 Selecting Courses
Maximum Minimum fee flow:
2195 going home
? 2400 supervisor, supervisee

Compress the stored DP
1038 bugs integrated Inc
1185 artillery positions
2430 lazy cow

Longest public substring (LCS ):
1080 human gene functions
1159 palindrome
1458 common subsequence
2192 zipper

Convex Hull
1113 Wall
2187 beauty contest
 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.