DP
关注
分享
扫一扫
Griffin_0
这个作者很懒，什么都没留下…
展开
-
hdu2602-Bone Collector(01背包模版题)
#include#include#include#include#include#include#include#include #include #include #include #include#define Maxn 1005typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;i++)#defi原创 2015-08-23 13:03:44 · 415 阅读 · 0 评论 -
hdu4508 湫湫系列故事——减肥记I(完全背包模板)
#include#include#include#include#include#includetypedef long long ll;using namespace std;#define Maxn 100050int dp[Maxn];int A[Maxn],B[Maxn];int main(){ int n,m,sum; while(~scanf("%原创 2015-08-21 10:11:45 · 496 阅读 · 0 评论 -
CodeForces 543A-Writing Code
#include#include#include#include#include#include#include#include#include#define Maxntypedef long long ll;using namespace std;#define FOR(i,first,n) for(int i=first;i<=n;i++)int dp[505][50原创 2015-08-23 14:24:02 · 484 阅读 · 0 评论 -
hdu1114-E - Piggy-Bank(完全背包)
#include#include#include#include#include#define Maxn 10050#define INF 0xffffffint val[550],weight[550];int dp[Maxn];typedef long long ll;using namespace std;int main(){ int T,E,F,N,sum;原创 2015-08-21 16:17:04 · 329 阅读 · 0 评论 -
hdu2955-Robberies（01背包 概率 ）
#include#include#include#include#includetypedef long long ll;#define Maxn 105int M[Maxn];double Pr[Maxn];double dp[Maxn*Maxn];using namespace std;int main(){ int T,N,i,j,sum; double原创 2015-08-21 14:52:57 · 547 阅读 · 0 评论 -
hdu1284-钱币兑换问题(简单dp)
简单dp 貌似可以用母函数做（理解思想不会实现#include#include#include#include#define Maxn 35000typedef long long ll;using namespace std;int dp[Maxn];int main(){ int n; dp[0]=1; int i,j;原创 2015-08-21 14:54:26 · 439 阅读 · 0 评论