动态规划 DP
123~mutouren
这个作者很懒,什么都没留下…
展开
-
hdu 1087 Super Jumping! Jumping! Jumping!
#include<bits/stdc++.h>using namespace std;int num[1010],dp[1010];int main (){ int n,ans; while (scanf("%d",&n),n) { ans=0; memset(dp,0,sizeof(dp)); for (int i=0;i<n;i++) { scanf("%d"原创 2021-06-03 20:21:09 · 63 阅读 · 0 评论 -
hdu 1257 最少拦截系统
#include <bits/stdc++.h>using namespace std;int a[10010],c,n,h,i;int main() { while (scanf("%d",&n)==1) { c = 1; memset(a, 0, sizeof(a)); scanf("%d",&h); a[1] = h; for ( i = 2; i <= n; ++i) {原创 2021-06-03 19:20:30 · 44 阅读 · 0 评论 -
hdu 1160 FatMouse‘s Speed
#include<bits/stdc++.h>using namespace std;#define MXM 1010struct Fm{ int w,s,id;}fm[MXM];int dp[MXM],t[MXM][MXM];int main (){ int i,j,pm,c = 0; while(scanf("%d%d",&fm[c+1].w,&fm[c+1].s)==2) { c++;fm[c].id = c; } sort(fm+1,fm+c原创 2021-06-01 18:00:21 · 51 阅读 · 0 评论 -
hdu 1176 免费馅饼
#include<bits/stdc++.h>using namespace std;#define MXM 100010#define MXN 15int dp[MXM][MXN];int main (){ int T,t,n,i,j,x; while(scanf("%d",&n),n) { T=0;memset(dp,0,sizeof dp); while(n--) { scanf("%d%d",&x,&t); dp[t][x原创 2021-05-27 19:29:39 · 61 阅读 · 0 评论 -
hdu 1421 搬寝室
#include<bits/stdc++.h>using namespace std;int dp[2001][1001];int Min(int a,int b){ return a<b?a:b;}int main(){ int n,k,i,j,a[2010]; while(cin>>n>>k) { for(i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+n+1);原创 2021-05-24 20:15:08 · 59 阅读 · 0 评论 -
hdu 2084 数塔
自底向上–从哪来#include<bits/stdc++.h>using namespace std;int dp[110][110];int main (){ int c,n,i,j; scanf("%d",&c); while(c--) { scanf("%d",&n); for(i = 1;i<=n;i++) { for(j = 1;j<=i;j++) scanf("%d",dp[i]+j); }原创 2021-05-23 16:27:50 · 44 阅读 · 0 评论