背包问题有好多种，那些名称也记得不太清，随便称呼吧，会做题就行，先试试4种常见的背包问题。 题目1：普通的背包问题（0-1背包） Input: Output: ...

Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Su ...

给你一个 n *m 的矩阵，求这个矩阵内部的最长上升子序列 记忆化去dp即可 在深搜的过程中去记忆化dp int dp[2005][2005]; int dfs(int x, int ...

Computer 时限：1000ms Problem Description A school bought the first computer some time ago(so this c ...

Godfather 时限：2000ms Description Last years Chicago was full of gangster fights and strange mur ...

Given an unsorted array of integers, find the length of longest increasing subsequence. Example: ...

The more, The Better 时限：2000ms Problem Description ACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物， ...