摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>using namespace std;int n,m;#define MIN -65530int a[110][110];int d[110][110];//到达此点之后还能获得的最大值void dp(int i,int j){ int jj; for(jj=j+1;jj<=m-n+i+1;jj++) { if(d[i+1][jj]==MIN) { d. 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>using namespace std;int n;int a[40010];int d[40010];int b[40010];int dmax;int main(){ int total; scanf("%d",&total); int i; while(total--) { scanf("%d",&n 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>#include<algorithm>using namespace std;int a[5002];int d[5002];int n;int main(){ while(scanf("%d",&n)!=EOF) { int i; for(i=0;i<n;i++) { scanf("%d",&a[i]); } int k=n; //.. 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>#include<algorithm>using namespace std;int a[5002];int d[5002];int main(){ int cases=1; while(scanf("%d",&a[0]),a[0]+1) { int k=1; while(scanf("%d",&a[k]),a[k]+1) { k++; } / 阅读全文