chengdazhuo-CSDN博客

原创 luogu2362:围栏木桩

#include<bits/stdc++.h>using namespace std;struct DP{int num,len;}dp[30];int a[30];int main(){ int m,n;scanf("%d",&m); for(int o=1;o<=m;o++) { int ans=0; scanf("%d",&n)...

2019-08-24 22:43:40 300

原创 luogu1417:烹饪方案

#include<bits/stdc++.h>using namespace std;int T,n;struct Food{long long a,b,c;}f[200010];bool cmp(Food A,Food B){ return A.c *B.b <B.c *A.b ;}long long dp[200010],ans=0; int main()...

2019-08-24 22:03:18 283

原创 luogu1130:红牌

#include<bits/stdc++.h>using namespace std;int a[2010][2010];int main(){ int n,m,ans=9999999; scanf("%d %d",&m,&n); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++)scanf("...

2019-08-24 13:16:31 193

原创 luogu1044:栈

#include<bits/stdc++.h>using namespace std;long long dp[22][22];int main(){ int n; scanf("%d",&n); dp[0][0]=1; for(int i=1;i<=n;i++) { for(int j=0;j<=i;j++) { dp[i][j]...

2019-08-24 13:03:43 133

原创 luogu2722/USACO3.1:Score Inflaction

#include<bits/stdc++.h>using namespace std;int dp[1000010];int main(){ int m,n; scanf("%d %d",&n,&m); for(int i=1;i<=m;i++) { int x,t; scanf("%d %d",&t,&x); fo...

2019-08-24 12:19:05 302

原创 luogu2925/USACO:Hay For Sale

#include<bits/stdc++.h>using namespace std;int f[50010];int a[50010];int main(){ int n,m; scanf("%d %d",&n,&m); for(int i=1;i<=m;i++) { scanf("%d",&a[i]); } for(int ...

2019-08-24 11:42:27 132

原创 luogu2918/USACO:Buying Hay

#include<bits/stdc++.h>using namespace std;struct g{int c,ma;}gr[110];int dp[1000010];int main(){ int n,m; scanf("%d %d",&n,&m); for(int i=1;i<=n;i++)scanf("%d %d",&gr[i]....

2019-08-24 11:36:05 109

原创 luogu2430:严酷的训练

#include<bits/stdc++.h>using namespace std;struct prb{int k,t,r;}p[5010];int a[5010];int dp[5010];int main(){ int x,y,m,n,T; scanf("%d %d %d %d",&x,&y,&m,&n); for(int i...

2019-08-24 11:21:17 167

原创 luogu3009/USACO:Profits

#include<bits/stdc++.h>using namespace std;int a[200010];int dp[200010];int ans=-999999999;int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); for(in...

2019-08-24 11:06:40 80

原创 luogu1507:NASA的食物计划

#include<bits/stdc++.h>using namespace std;struct A{int N,M,K;}a[60];int n,m;int dp[410][410];int main(){ scanf("%d %d",&n,&m); int num; scanf("%d",&num); for(int i=1;i<...

2019-08-24 11:01:23 81

原创 luogu2871/USACO:Charm Bracelet

#include<bits/stdc++.h>using namespace std;struct A{int m,v;}a[3550];int dp[13000];int main(){ int n,V; scanf("%d %d",&n,&V); for(int i=1;i<=n;i++)scanf("%d %d",&a[i].m ,...

2019-08-24 10:46:16 91

原创 luogu1926:小书童——刷题大军

#include<bits/stdc++.h>using namespace std;int a[1010];struct B{int t,sc;}b[1010];struct DP{int sc,t;}dp[1010];int dp2[1010];int main(){ int n,m,k,r,tt=999999999; scanf("%d %d %d %d",&a...

2019-08-24 10:22:21 133

原创 luogu2347:砝码称重

#include<bits/stdc++.h>using namespace std;int b[7]={0,1,2,3,5,10,20};int s[7];int a[1010];int dp[1010];int main(){ dp[0]=1; int num=0,ans=0; for(int i=1;i<=6;i++) { scanf("%d",&...

2019-08-23 22:42:44 162

原创 luogu2782:友好城市

#include<bits/stdc++.h>using namespace std;struct A{int l,r;} a[200010];int s[200010];bool cmp(A B,A C){ return B.l <C.l ;}int main(){ int n,len=0; scanf("%d",&n); ...

2019-08-23 20:41:25 112

原创 luogu1719:最大加权矩形

#include<bits/stdc++.h>using namespace std;int a[130][130];int b[130];int dp[130];int main(){ int n,ans=-999999999; scanf("%d",&n); for(int i=1;i<=n;i++) { for(int j=1;j<=...

2019-08-23 13:17:04 207

原创 luogu1115:最大子段和

#include<bits/stdc++.h>using namespace std;int a[200010];int dp[200010];int ans=-999999999;int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); for(in...

2019-08-23 11:55:36 104

原创 luogu1754:球迷购票问题

#include<bits/stdc++.h>using namespace std;long long dp[22][22];int main(){ int n; scanf("%d",&n); dp[0][0]=1; for(int i=1;i<=n;i++) { for(int j=0;j<=i;j++) { dp[i][j]...

2019-08-23 10:57:16 218

原创 luogu2858/USACO:Treats for the Cows

#include<bits/stdc++.h>using namespace std;int a[2010];int dp[2010][2010];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); for(int i=1;i<=n;i++...

2019-08-23 10:40:02 162

原创 luogu1910:L国的战斗之间谍

#include<bits/stdc++.h>using namespace std;int dp[1010][1010];struct A{int t,m,p;}a[1010];int main(){ int n,T,M,ans=0; scanf("%d %d %d",&n,&M,&T); for(int k=1;k<=n;k++) ...

2019-08-22 22:34:46 131

原创 luogu1509:找啊找啊找GF

#include<bits/stdc++.h>using namespace std;struct A{int mon,rp,time;}a[110];struct DP{int t,num;}dp[110][110];int main(){ int n,m,r,lt=999999999,ans; scanf("%d",&n); for(int i=1;i&l...

2019-08-22 22:23:46 183

原创 luogu1759:通天之潜水

#include<bits/stdc++.h>using namespace std;struct DP{int val;bool cho[110];}dp[210][210];struct A{int t,m,p;}a[110];bool w[110]; int main(){ int n,T,M; scanf("%d %d %d",&M,&T,&a...

2019-08-21 21:59:54 144

原创 luogu1063:能量项链

#include<bits/stdc++.h>using namespace std;struct Ball{int he,ta;}ball[100010];int dp[1010][1010];int main(){ int n,ans=0; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",...

2019-08-21 21:38:07 85

原创 luogu2725/USACO3.1:Stamps

#include<bits/stdc++.h>using namespace std;struct dp{bool p;int mi;}a[10000010];int b[100010];int maxx=0;int main(){ int N,K; scanf("%d %d",&K,&N); for(int i=1;i<=N;i++) {...

2019-08-21 21:35:25 116

原创 luogu2701/USACO5.3:Big Barn

#include<bits/stdc++.h>using namespace std;int a[1010][1010];int dp[1010][1010];int h[1010][1010];int d[1010][1010];int minn(int p,int q,int r){ p=min(p,q); p=min(p,r); return p;}in...

2019-08-20 22:24:30 82

原创 luogu1474/USACO2.3:Money Systems

#include<bits/stdc++.h>using namespace std;long long dp[10100],a[30];int main(){ int n,m; memset(dp,0,sizeof(dp)); dp[0]=1; scanf("%d %d",&n,&m); for(int i=1;i<=n;i++) { ...

2019-08-20 22:13:58 114

原创 luogu1855:榨取kkksc03

#include<bits/stdc++.h>using namespace std;int dp[210][210];struct A{int t,m;}a[110];int main(){ int n,T,M,ans=0; scanf("%d %d %d",&n,&M,&T); for(int k=1;k<=n;k++) { s...

2019-08-20 10:34:15 186

原创 luogu1203/USACO1.2:Broken Necklace

#include<bits/stdc++.h>using namespace std;char a[3010];int n,ans,ans1,ans2;int dfs(int x,int p,int i){ int q=p+x;int w; if(p-i==n||i-p==n) { printf("%d\n",n); exit(0); } if(a[p]...

2019-08-19 22:01:05 123

原创 luogu1880:石子合并

#include<bits/stdc++.h>using namespace std;int a[210];int sum[210];int f1[210][210];int f2[210][210];int main(){ int n,ans1=0,ans2=999999999; scanf("%d",&n); for(int i=1;i<=n;i+...

2019-08-19 11:33:47 71

原创 luogu1736:创意吃鱼法

#include<bits/stdc++.h>using namespace std;int a[2510][2510];int dp[2510][2510];int h[2510][2510];int d[2510][2510];int minn(int p,int q,int r){ p=min(p,q); p=min(p,r); return p;}in...

2019-08-19 11:01:49 119

原创 luogu1681:最大正方形II

#include<bits/stdc++.h>using namespace std;int a[1510][1510];int dp[1510][1510];int h[1510][1510];int d[1510][1510];int minn(int p,int q,int r){ p=min(p,q); p=min(p,r); return p;}in...

2019-08-19 10:25:48 86

原创 AtCode2827:LIS

#include<bits/stdc++.h>using namespace std;int a[100010];int s[100010];int main(){ int n,len=0; scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); s[++len]=a[1]; for(...

2019-08-19 09:48:13 148

原创 luogu1387:最大正方形

#include<bits/stdc++.h>using namespace std;int a[110][110];int dp[110][110];int h[110][110];int d[110][110];int minn(int p,int q,int r){ p=min(p,q); p=min(p,r); return p;}int main()...

2019-08-18 21:41:15 73

原创 luogu1004:方格取数

#include<bits/stdc++.h>using namespace std;int dp[55][55][55][55];int f[55][55];int maxx(int a,int b,int c,int d){ a=max(a,b); a=max(a,c); a=max(a,d); return a;}int main(){ int n; ...

2019-08-18 14:03:12 80

原创 luogu1006:传纸条

#include<bits/stdc++.h>using namespace std;int dp[55][55][55][55];int f[55][55];int maxx(int a,int b,int c,int d){ a=max(a,b); a=max(a,c); a=max(a,d); return a;}int main(){ int n,m;...

2019-08-18 13:46:46 115

原创 luogu1140:相似基因

#include<bits/stdc++.h>using namespace std;char s[1010];int a[1010];int b[1010];int c[5][5]={ {0,-3,-4,-2,-1}, {-3,5,-1,-2,-1}, {-4,-1,5,-3,-2}, {-2,-2,-3,5,-2}, {-1,-1,-2,-2,5}};in...

2019-08-17 16:09:21 98

原创 NOIoj1759:最长上升子序列

#include<bits/stdc++.h>using namespace std;int a[1010],dp[1010],ans;int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } a[0]=-1; for(int i=1;i...

2019-08-17 12:47:02 180

原创 NOIoj1996:登山

#include<bits/stdc++.h>using namespace std;int a[1010],n,dp1[1010],dp2[1010],u;int main(){ scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); for(int i=1;i<=n;i++) { ...

2019-08-17 10:42:01 302

原创 luogu1233:木棍加工

正确代码#include<bits/stdc++.h>using namespace std;struct wood{int wid,len;}a[5010];int f[5010];bool cmp(wood A,wood B){ if(A.len ==B.len )return A.wid >B.wid ; return A.len >B.len ;}...

2019-08-11 19:27:19 216

原创 luogu1095:守望者的逃离

#include<bits/stdc++.h>using namespace std;int dp[300010];int main(){ int mp,s,t; scanf("%d %d %d",&mp,&s,&t); for(int i=1;i<=t;i++) { if(mp>=10) { dp[i]=dp[i-...

2019-08-11 19:12:07 117

原创 luogu1508:Likecloud-吃、吃、吃

#include<bits/stdc++.h>using namespace std;int f[210][210];int main(){ int m,n; memset(f,-9999,sizeof(f)); scanf("%d %d",&m,&n); for(int i=1;i<=m;i++) { for(int j=1;j<=...

2019-08-11 19:06:55 142

空空如也

空空如也