POJ - 2541
2013-06-21 16:17
176 查看
#include<cstdio> #include<iostream> #include<cstdlib> #include<algorithm> #include<cmath> #include<string> #include<cstring> #include<set> #include<map> #include<list> #include<queue> #include<vector> #define tree int o,int l,int r #define lson o<<1,l,mid #define rson o<<1|1,mid+1,r #define lo o<<1 #define ro o<<1|1 #define ULL unsigned long long #define LL long long #define UI unsigned int #define inf 0x7fffffff #define eps 1e-7 #define N 1000009 #define M 20009 using namespace std; int T,n,m,k,t; char str ; int dp[13][1110010]; int main() { #ifndef ONLINE_JUDGE freopen("ex.in","r",stdin); #endif while (scanf("%d%d",&n,&m)!=EOF) { memset(dp,0,sizeof(dp)); scanf("%s",str); n=strlen(str); str[n+m]='\0'; for(int i=0; i<n+m-1; i++) { int sum=0; if(i>=n-1)str[i+1]='0';//要先处理! for(int j=0;j<13&&i-j>=0;j++) { if(str[i-j]-'0') sum+=(1<<(j)); if(i>=n-1&&dp[j][sum]) { str[i+1]=str[dp[j][sum]]; } dp[j][sum]=i+1; } } cout<<str+n<<endl; } return 0; }
相关文章推荐
- poj 2541 (kmp 或 状压dp)
- poj 2541 Binary Witch
- POJ 2541 Binary Witch 状压DP
- POJ 2541 Binary Witch
- poj 2541 Binary Witch(状态压缩)
- poj 2541 Binary Witch
- kmp练习 poj 2541
- poj 2541 binary witch
- POJ 2541 Binary Witch(逆序KMP,好题)
- poj 2541 Binary Witch (KMP+逆序转换+字符数组前端插入)
- poj 2541 Binary Witch(状压dp)
- POJ 2541 Binary Witch
- poj 3615 :Cow Hurdles (floyd)----很好
- POJ1258
- poj-1730 Perfect Pth Powers
- POJ 1751 Highways 最小生成树
- poj 2479 最大子数段
- POJ 2823 Sliding Window
- POJ 1459 Power Network 多源点多汇点+最大流(EK算法)
- poj1848 Tree