Big String poj 2887

题目

分析

code

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string>
#include<cmath>

#define long long LL;

using namespace std;

const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1e3+10;

char s[N*N],belong
[N*3],in[2];
int l
,n,m,x;

void add(char ch,int x)
{
int nl=0,pn;
for(int i=1;i<=n;i++)
{
if(nl+l[i]>=x){pn=i;break;}
if(i==n) {pn=n;break;}
nl+=l[i];
}
int p=min(l[pn],x-nl-1);
for(int i=l[pn];i>p;i--)
belong[pn][i]=belong[pn][i-1];
belong[pn][p]=ch;
l[pn]++;
}

char query(int x)
{
int nl=0;
for(int i=1;i<=n;i++)
{
if(nl+l[i]>=x) return belong[i][x-nl-1];
nl+=l[i];
}
}

int main()
{
while (~scanf("%s",s))
{
int len=strlen(s);
int block=sqrt(len+999)+10;
n=(len-1)/block+1;
for (int i=1;i<=n;i++) l[i]=block;
for (int i=0;i<len;i++) belong[i/block+1][i%block]=s[i];
l
=(len-1)%block+1;
scanf("%d",&m);
while (m--)
{
scanf("%s",in);
if(in[0]=='Q')
{
scanf("%d",&x);
printf("%c\n",query(x));
}
else
{
scanf("%s%d",in,&x);
add(in[0],x);
}
}
}
return 0;
}