hdu2191- 悼念512汶川大地震遇难同胞――珍惜现在，感恩生活(多重背包)
Problem Description 急！灾区的食物依然短缺！ 为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你一共有资金n元，而市场有m种大米，每种大米都是袋装产品，其价格不等，并且只能整袋购买。 请问：你用有限的资金最多能采购多少公斤粮食呢？后记： 人...
hdu1003 Max Sum(dp)
Problem Description Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7),...
Codeforces59 B - Fortune Telling（再水）
B. Fortune Telling time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Marina loves Sasha....
Codeforces59A - Word（水）
A. Word time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Vasya is very upset that many ...
插入排序&归并排序&堆排序
插入排序#include void insertion_sort(int *arr,int len){ int i,j; int temp; for(int i=1;i
POJ-3126 Prime Path(BFS 求最小步数)
DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the fou...
POJ-1426 Find The Multiple ( BFS )
http://poj.org/problem?id=1426 Find The Multiple Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 28996 Accepted: 12023 ...
POJ-1787 Charlie's Change( 多重背包记录方案)
http://poj.org/problem?id=1787 Charlie’s Change Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4238 Accepted: 1325 Descripti...
UVA562 Dividing coins （01背包）
Dividing coins Description It’s commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made ...
POJ 3624- Charm Bracelet（01背包 滚动数组）
Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36395 Accepted: 15944 DescriptionBessie has gone to the mall...