AM动态规划问题简易模板(可编译).docVIP

include stdio.h ^include stdlib.h //背包问题 测试数据： 输入： 8 2378334962 输出：*/ int num,c; int v[10]; int w[10]; int m[10][30];//设则表示在前i个物品中，背包大小是j的情况卜，背包所装东西的最 大价值 void knapsack)) { int n=num-l; int jmax,i,j; if(w[n]c) jmax=w[n]; else jmax=c; for(i=0;ijmax;i++) m[n】[i]=0; for(i=w[n];i=c;i++) m[n][i]=v[n]; for(i=n-l;i0;i-) { if(w[i]c) jmax=w[i]; else jmax=c; for(j=0;jjmax;j++) m[i][j]=m[i+l][j]; for(j=w[i];j=c;j++) { if(m[i+l][j]m[i+l]O-w[i]]+v[i]) m[i][j]=m[i+l][j-w[i]]+v[i]; else } m[O][c]=m[l][c]; if(c=w[O]) { if(m[O][c]m[l][c-w[O]]+v[O]) m[O][c]=m[l][c-w[O]]+v[O]; } void trackback(int *x) { int n=num-l; int i; for(i=0;in;i++) { if(m[i][c]==m[i+l][c]) x[i]=O; else { x[i]=l; c=c-w[i]; } } if(m[n][c]0) x[n]=l; else x[n]=0; } int main() { int i,x[10】,j; scanf(%d %d/num/c); for(i=0;inum;i++) scanf(%dH，v[i]); for(i=0;inum;i++) scanf(o/odn，w[i]); knapsack(); for(i=0;i=c;i++) printf(%3d/i); printf(\nH); for(i=0;inum;i++) { for(j=0;j=c;j++) printf(%3d,m[i】[j]); printf(\n}; } trackback(x); for(i=0;inum;i++) printf(%d ,x[i]); printfCXn1); return 0; 2、KMP算法 #includeiostream #includestring.h using namespace std; inline void BuildNext(const char* pattern, size_t length, unsigned int* next) { unsigned int i, t; i = l； t = 0; next[l] = 0; while(i length + 1) { while(t 0 pattern[i -1] != pattern[t -1]) { t = next[t]; } ++t; ++i; if(pattern[i -1] == pattern[t -1]) { next[i] = next[t]; } else { next[i] = t; } } //pattern末嵐的结束符控制，川于寻找B标字符串屮的所有匹配结果川 while(t 0 pattern[i -1] != pattern[t -1]) { t = next[t]; ++t; ++i; next[i] = t; } unsigned int KMP(const char* text, size_t textjength, const char* pattern, size」patternjength, unsigned int* matches) { unsigned int i, j, n; unsigned int next[pattern_length + 2]; BuildNext(pattern, patternjength, next); i = 0; j = l； n = 0; while(pattern_length + 1 - j = textjength - i) { if(text[i] == pattern [j -1]) { ++i； ++j； //发现匹配结果，将匹配子串的位s,加入结果 if(j == patternjength + 1) { matches[n++] = i - patternjength; j = next[j]; } } else { j