HDU 3183

来源：互联网发布：任子行网络审计编辑：程序博客网时间：2024/06/01 09:35

RMQ的应用题。

题目思路请参考：http://blog.csdn.net/acdreamers/article/details/8692384

RMQ请参考：http://blog.csdn.net/liang5630/article/details/7917702

代码请参考：

#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<queue>#define MAXN 1003using namespace std;int min_num[MAXN][MAXN],n,m; char num[MAXN];void RMQ_init(){for(int i=1;i<=n;i++) min_num[i][0]=num[i-1]-'0';int j_max=(log(n)/log(2.0));for(int j=1;j<=j_max;j++){for(int i=1;i<=n;i++)if(i+(1 << j)-1 <= n) min_num[i][j]=min(min_num[i][j-1],min_num[i+(1<<(j-1))][j-1]);}}int query(int l,int r){int k=log(r-l+1)/log(2.0);return min(min_num[l][k],min_num[r-(1<<k)+1][k]);}int find(int x,int l,int r){for(int i=l;i<=r;i++) if(num[i-1]-'0'==x) return i;}int main(){while(scanf("%s %d",num,&m)!=EOF){n=strlen(num);RMQ_init();queue<int> q;int l=1,r=m+1;for(int i=1;i<=n-m;i++){int now=query(l,r);q.push(now);l=find(now,l,r)+1;r+=1;}bool flag=0;while(!q.empty()){int now=q.front();q.pop();if(now==0 && flag) printf("0");if(now!=0){printf("%d",now);flag=1;}}if(flag==0) printf("0");printf("\n");}}

0 0