- 博客(7)
- 资源 (4)
- 收藏
- 关注
原创 杭电2602
哎,动态规划背包搞了好多天,终于搞懂了。。。坚持就是胜利Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 43080 Accepted Submission(s): 17962
2015-12-28 20:36:16 264
转载 算法之美:动态规划
前言和分治法一样,动态规划(dynamic programing)是通过组合子问题的解而解决整个问题的。注意这里的programing翻译成立规划而不是编程。维基百科上写道This is also usually done in a tabular form by iteratively generating solutions to bigger and bigger subpr
2015-12-26 23:38:13 318
原创 杭电2124
Repair the WallTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3006 Accepted Submission(s): 1472Problem DescriptionLong time
2015-12-23 20:44:03 335
原创 杭电2187
悼念512汶川大地震遇难同胞——老人是真饿了Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11020 Accepted Submission(s): 4565Problem Description时间
2015-12-23 19:55:36 327
转载 卡片游戏
(卡片游戏)有一叠牌,从第一张往下依次编号1~n。当还剩两张牌时进行操作:把第一张牌扔掉,然后把新的第一张放在牌的最后。输入n,输出每次扔掉的牌,及最后剩下的牌。E.g:input:7Output:1 3 5 7 4 2 6 (算法入门经典89)#include#includeusing namespace std;queue q;int main(){ int
2015-12-21 11:15:09 365
原创 二分查找入门
#include#includeusing namespace std;int main(){ int a[10]={2,7,9,15, 34,56,90,96,123,345},i,x,top,bottom,mid,count=0; cin>>x; sort(a,a+10); top=0;bottom=9; while(top<=bottom) { mid=((top+b
2015-12-21 11:07:15 267
原创 贪心算法入门(杭电2037)
#include#includeusing namespace std;void compare(int n,int *a,int *b,bool *c){ int i,j=0; c[0]=1; for(i=1;i<n;i++) { if(a[i]>=b[j]) { c[i]=true;
2015-12-21 11:02:33 423
log4j.properties/jar
2017-09-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人