hanyanwei123的博客

Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 273286 Accepted Submission(s): 64880Problem Description Given a sequence a[1],a...

最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37574 Accepted Submission(s): 16939Problem Description 给定K个整数的序列{ ...

题目：给定m种硬币，支付n元所需硬币最少个数。各面值课重复使用。 贪心算法从面值大的开始减。对于某些特殊问题不行 动态规划解题： 两个数组 C[m] 表示第i枚硬币的面值 T[m][n+1] 表示使用第i种硬币支付j元需要的最少硬币数 动态规划递归方程： T[i][j] = min(T[i-1][j],T[i][j-C[i]]+1) ...

参考背包九讲 一01背包 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。 状态转移方程便是：f[i][v]=max{f[i-1][v],f[i-1][v-c[i]+w[i]} 最重要的地方：V的顺序（刚刚弄懂） 基本思路实现，有一个主循环i=1..N，每次算出来二维数组f[i][0..V...

转自：https://blog.csdn.net/qq_34374664/article/details/54577940class=”title-article”>codeforces 429B B. Working out 详解(dp) 2017年0...

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to makechanges with these coins for a given amount of money. For example, if we have 11 cents, then we can...

母牛的故事 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 104973 Accepted Submission(s): 51502Problem Description 有一头母牛，它每年年初生一头小母牛。每头小母牛从第...