![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
藏星七夕明
这个作者很懒,什么都没留下…
展开
-
hdu 1087
Super Jumping! Jumping! Jumping! #include<bits/stdc++.h> using namespace std; #define MAX 1001 int n,dp[MAX],ans; struct node{ int x,y; }a[MAX]; bool cmp(int x,int y){ return a[x].x<a[y].x; } int main(){ int b[MAX],cnt; while(scanf("%d",&n原创 2021-07-16 11:36:41 · 46 阅读 · 0 评论 -
hdu 1257
最少拦截系统 #include<bits/stdc++.h> using namespace std; #define MAX 30001 int n,high,dp[MAX]; int main(){ while(cin>>n){ memset(dp,0,sizeof dp); for(int i=1;i<=n;i++){ cin>>high; dp[high]++; for(int j=1;j<high;j++){ if原创 2021-07-14 20:39:14 · 67 阅读 · 0 评论 -
hdu 1160
FatMouse’s Speed #include<bits/stdc++.h> using namespace std; #define MAXN 1010 struct s{ int f; int v; int id; }m[MAXN]; bool cmp(s a,s b){ return a.v>b.v; } int f,v,dp[MAXN],pre[MAXN]; int main() { int count=0,p,len=0; while(scanf("%d %d",原创 2021-06-03 20:18:39 · 45 阅读 · 0 评论 -
hdu 1950
Bridging signals #include<bits/stdc++.h> using namespace std; #define MAXN 40010 int n,dp[MAXN],d[MAXN]; int main(){ int t,x,len; scanf("%d",&t); while(t--){ scanf("%d",&n); memset(dp,0,sizeof dp); for(int i=1;i<=n;i++){ scanf(原创 2021-05-31 20:39:48 · 51 阅读 · 0 评论 -
hdu 1421
搬寝室 #include<bits/stdc++.h> using namespace std; #define INF 0x7fffffff //int型最大值 #define MAXN 2020 bool cmp(int a,int b){ return a>b; } int n,k,dp[MAXN][MAXN],a[MAXN]; int main(){ while(scanf("%d %d",&n,&k)!=EOF){ for(int i=1;i<=n;原创 2021-05-29 17:36:53 · 54 阅读 · 0 评论 -
hdu 1176
免费馅饼 #include<bits/stdc++.h> using namespace std; #define MXX 15 #define MXT 100010 int n,dp[MXT][MXX]; int main() { int T,t,x; while(scanf("%d",&n),n){ T=0; memset(dp,0,sizeof dp); for(int i=1;i<=n;++i){ scanf("%d %d",&x,&原创 2021-05-24 19:29:33 · 38 阅读 · 0 评论 -
hdu 2048
数塔 #include<bits/stdc++.h> using namespace std; #define ll long long #define MAXN 110 int n,dp[MAXN][MAXN]; int main() { int N; scanf("%d",&N); while(N--){ scanf("%d",&n); for(int i=1;i<=n;++i){ for(int j=1;j<=i;++j){ scan原创 2021-05-23 20:40:32 · 74 阅读 · 0 评论