POJ动态规划题目列表

POJ1050非常经典，用捆绑法将二维问题转化到一维的状态来求解。

poj 1050 √最大子矩阵和：捆绑子矩阵转化为最大连续子段和问题
poj 1088 √四方向记忆化搜索dp[i][j]=max(dp[i-1][j]...)+1遍历所 

          有点，注意处理边界
poj 1163 √数塔dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i][j]
poj 1159 √dp[s][e]=min(dp[s+1][e],dp[s][e-1])+1 字符不同
poj 3280 √dp[i][j]=min(dp[i+1][j]+cost[s[i]-'a'],
                        dp[i][j-1]+cost[s[j]-'a'])
poj 3616 √dp[i]=max(dp[i],dp[j]+a[i].w) a[i].s>=a[j].e+r
poj 1458 √lcs dp[i][j]=max(dp[i-1][j],dp[i][j-1])||dp[i-1]   

                                                    [j-1]+1 
poj 1579 √记忆化搜索
poj 2081 √(dp[i-1]-i>=0)? dp[i]=dp[i-1]-i :dp[i]=dp[i-1]+i
poj 1953 √FIB
poj 2250 √LCS用string处理
poj 1887 √LDS
poj 2533 √LIS
poj 1631 √LIS nlogn
poj 1080 √LCS变形 预处理边界和加'-'后的配对情况
poj 2192 √c[i+j]==b[j]&&dp[i][j-1]==1||c[i+j]==a[i]&&dp[i-1][j]==1   dp[i][j]=1  画转移矩阵
poj 3356 √LCS变形 dp[i][j]=min(a[i-1]==b[j-1]?dp[i-1][j-1],dp[i-1][j-1]+1,dp[i-1][j]+1,dp[i][j-1]+1)
poj 1157 √dp[i][j]=max(dp[i-1][j-1]+a[i][j],dp[i][j-1])
poj 1014 √多重背包化01背包
poj 1125 √多源最短路中最大值的最小者FLOYD暴过

1.POJ动态规划题目列表

           容易：1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1208, 1276,1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740(博弈),1742, 1887, 1926(马尔科夫矩阵，求平衡）, 1936, 1952, 1953, 1958, 1959, 1962, 1975, 1989, 2018,2029, 2039, 2063, 2081, 2082, 2181, 2184, 2192, 

2279, √杨氏矩阵和钩子公式

2231, √任意两数之间差的总和

2329, √搜索用动规写，好难

2336, √运车过河的最短时间和次数

2346, √数位DP，求N位数有多少种不同的和

2353, √双向动规，输出过程

2355, √线段dp，坐车买票问题

2356, √抽屉原理

2385, √牛吃苹果

2392  √01背包, 

2424   √模拟,

           不易： 1019, 1037, 1080, 1112, 1141, 1170, 1192, 1239, 1655,1695, 1707, 1733(区间减法加并查集), 1737, 1837, 1850, 1920(加强版汉罗塔),1934(全部最长公共子序列), 1937(计算几何), 1964(最大矩形面积，O(n)算法), 2138, 2151, 2161, 2178,

            推荐： 1015, 1635, 1636(挺好的),1671, 1682, 1692(优化), 1704, 1717, 1722, 1726, 1732, 1770, 1821, 1853, 1949,2019, 2127, 2176, 2228, 2287, 2342, 2374, 2378, 2384, 2411

 1015 Jury Compromise 1029 False coin 1036Gangsters 1037 A decorative fence 1038 Bugs Integrated, Inc. 1042 Gone Fishing1050 To the Max 1062 昂贵的聘礼 1074 Parallel Expectations 1080 Human Gene Functions1088 滑雪1093 Formatting Text 1112 Team Them Up! 1141 BracketsSequence 1143 Number Game 1157 LITTLE SHOP OF FLOWERS 1159 Palindrome 1160 PostOffice 1163 The Triangle 1170 Shopping Offers 1178 Camelot 1179 Polygon 1180Batch Scheduling 1185 炮兵阵地 1187 陨石的秘密 1189 钉子和小球 1191 棋盘分割 1192 最优连通子集 1208 The Blocks Problem 1239 Increasing Sequences 1240Pre-Post-erous! 1276 Cash Machine 1293 Duty Free Shop 1322 Chocolate 1323 GamePrediction 1338 Ugly Numbers 1390 Blocks 1414 Life Line 1432 Decoding MorseSequences 1456 Supermarket 1458 Common Subsequence 1475 Pushing Boxes 1485 FastFood 1505 Copying Books 1513 Scheduling Lectures 1579 Function Run Fun 1609Tiling Up Blocks 1631 Bridging signals 2 分+DPNLOGN 1633 Gladiators 1635 Subway tree systems 1636 Prison rearrangement 1644To Bet or Not To Bet 1649 Market Place 1651 Multiplication Puzzle 1655Balancing Act 1661 Help Jimmy 1664 放苹果 1671 Rhyme Schemes 1682 Clans on the Three Gorges 1690(Your)((Term)((Project))) 1691 Painting A Board 1692 Crossed Matchings 1695Magazine Delivery 1699 Best Sequence 1704 Georgia and Bob 1707 Sum of powers1712 Flying Stars 1714 The Cave 1717 Dominoes 1718 River Crossing 1722 SUBTRACT1726 Tango Tango Insurrection 1732 Phone numbers 1733 Parity game 1737Connected Graph 1740 A New Stone Game 1742 Coins P 1745 Divisibility 1770Special Experiment 1771 Elevator Stopping Plan 1776 Task Sequences 1821 Fence1837 Balance 1848 Tree 1850 Code 1853 Cat 1874 Trade on Verweggistan 1887Testing the CATCHER 1889 Package Pricing 1920 Towers of Hanoi 1926 Pollution1934 Trip 1936 All in All 1937 Balanced Food 1946 Cow Cycling 1947 RebuildingRoads 1949 Chores 1952 BUY LOW, BUY LOWER 1953 World Cup Noise 1958 StrangeTowers of Hanoi 1959 Darts 1962 Corporative Network 1964 City Game 1975 MedianWeight Bead 1989 The Cow Lineup 2018 Best Cow Fences 2019 Cornfields 2029 GetMany Persimmon Trees 2033 Alphacode 2039 To and Fro 2047 Concert HallScheduling 2063 Investment 2081 Recaman's Sequence 2082 Terrible Sets 2084 Gameof Connections 2127 Greatest Common Increasing Subsequence 2138 Travel Games2151 Check the difficulty of problems 2152 Fire 2161 Chandelier 2176 Folding2178 Heroes Of Might And Magic 2181 Jumping Cows 2184 Cow Exhibition 2192Zipper 2193 Lenny's Lucky Lotto Lists 2228 Naptime 2231 Moo Volume 2279 Mr.Young's Picture Permutations 2287 Tian Ji -- The Horse Racing 2288 Islands andBridges 2292 Optimal Keypad 2329 Nearest number - 2 2336 Ferry Loading II 2342Anniversary party 2346 Lucky tickets 2353 Ministry 2355 Railway tickets 2356Find a multiple 2374 Fence Obstacle Course 2378 Tree Cutting 2384 HarderSokoban Problem 2385 Apple Catching 2386 Lake Counting 2392 Space Elevator 2397Spiderman 2411 Mondriaan's Dream 2414 Phylogenetic Trees Inherited 2424 Flo'sRestaurant 2430 Lazy Cows 2915 Zuma 3017 Cut the Sequence 3028 Shoot-out 3124The Bookcase 3133 Manhattan Wiring 3345 Bribing FIPA 3375 Network Connection3420 Quad Tiling ?http://www.gccfeli.cn/?cat=5