ACM分类

—————————–最优化问题———————————————————-动态规划 SOJ1162 I-Keyboard SOJ2096 Maximum Submatrix SOJ2111 littleken bg SOJ2505 The County Fair SOJ2818 QQ 音速 SOJ2469 Exploring Pyramids SOJ1833 Base Numbers

SOJ2009 Zeros and Ones SOJ2032 The Lost House SOJ2289 A decorative fence SOJ2089 lykoo SOJ2440 The days in fzk SOJ2718 Bookshelf SOJ2722 Treats for the Cows(二维状态，0维决策) SOJ2726 Deck of Cards SOJ2729 Space Elevator SOJ2730 Lazy Cows SOJ2702 Alanna SOJ2713 Cut the Sequence SOJ2768 Bomb

SOJ2779 Find the max (I) (最大 M 子段和问题) SOJ2796 Letter Deletion(DP 基础题，最长公共子序列问题) SOJ2800 三角形 SOJ2804 Longest Ordered Subsequence (II) SOJ2896 Alphacode (动态规划简单题) SOJ2930 积木城堡 SOJ3037 Painting the balls SOJ3104 Game(注意大数运算，高精度) SOJ3264 Evil Game SOJ3300 Stockholm Coins(背包问题) SOJ3360 Buying Hay(背包问题) SOJ3531 Number Pyramids(背包问题)

—————-状态 DP SOJ2089 lykoo SOJ2819 Ader SOJ2842 The TSP problem SOJ3025 Artillery(状态 DP) SOJ3088 windy’s cake VIII SOJ3259 Counting numbers SOJ3262 Square Fields(二分+状态 DP) SOJ3371 Mixed Up Cows Continue reading →

原创文章，转载请注明： 转载自 ACM 解题报告

本文链接地址: 各大 OJ 题目归类

Posted in OJ | Tagged ACM | Leave a reply