- 博客(6)
- 收藏
- 关注
原创 完全背包:Piggy-Bank猪猪储蓄罐
完全背包:Piggy-Bank猪猪储蓄罐 Time Limit:1000MS Memory Limit:65536K Total Submit:14 Accepted:6 Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtaine
2012-06-08 19:03:46 913
原创 01背包 Bone Collector骨骼收集家
题目: 01背包:Bone Collector骨骼收集家 Time Limit:1000MS Memory Limit:65536K Total Submit:44 Accepted:7 Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector
2012-06-08 18:06:10 513
原创 pasture三角形牧场 动态规划
题目: 【培训习题.动态规划】8.7pasture三角形牧场 Time Limit:1000MS Memory Limit:65536K Total Submit:32 Accepted:6 Description 和所有人一样,奶牛喜欢变化。它们正在设想新造型的牧场。奶牛建筑师Hei想建造围有漂亮白色栅栏的三角形牧场。她拥有N(3≤N≤40)块木板,每块的长度Li(1≤Li≤40)都
2012-06-08 01:15:40 1036
原创 book的复制
题目: 代码: #include #include int f[501][501]={0},value[501]={0},book[501]={0},ans[501][501]={0}; int n,k; int max(int a,int b) { if(a>b)return a; return b; } int min(int a,int b) { if(a<b)return a;
2012-06-02 23:14:54 371
原创 动态规划
题目:http://60.191.162.158:8080/JudgeOnline/showproblem?problem_id=1230 代码: #include int f[10001]={0},task[10001][3]={0},time[10001][3]={0}; int main() { int n,k,i,j,p; scanf("%d%d",&n,&k); p=0;
2012-05-31 14:54:53 216
原创 试水
#include #include #include #include int bs(int a){ if(a<0)return -a; return a; } int min (int a,int b,int c){ int temp; temp=b; if(a<b)temp=a; if(c<temp)temp=c; retu
2012-05-31 00:21:12 289
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人