随笔分类 - 数据结构与算法----动态规划
线性DP
背包
数字三角形
摘要:Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 65333 Accepted: 27331 Description A subsequence of a given sequence is t
阅读全文
摘要:Maximum sum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 44459 Accepted: 13794 Description Given a set of n integers: A={a1, a2,..., an}
阅读全文
摘要:Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 66763 Accepted: 29906 Description A numeric sequence of ai is o
阅读全文
摘要:Pearls Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10558 Accepted: 5489 Description In Pearlania everybody is fond of pearls. One compa
阅读全文

浙公网安备 33010602011771号