随笔分类 - 动态规划
ACM重点
摘要:View Code #include<stdio.h>#include<string.h>#define max(a,b)(a>b?a:b)int dp[1<<10+5][11];int len[11][11];int n;char str[11][11];int main(){ int n,i,j,k,x,count; int len1,len2,max; while(scanf("%d",&n),n) { memset(len,0,sizeof(len)); for(i=0;i<n;i++) scanf("
阅读全文
摘要:#include<stdio.h>#include<string.h>int a[10001];bool dp[10001][101];int n,m;int get_val(){ int ret(0); char c; while((c=getchar())==' '||c=='\n'||c=='\r'); ret=c-'0'; while((c=getchar())!=' '&&c!='\n'&&c!='\r') ret=r
阅读全文

浙公网安备 33010602011771号