B. Pasha and String

最新推荐文章于 2020-09-05 04:49:33 发布

sprite_

最新推荐文章于 2020-09-05 04:49:33 发布

阅读量261

点赞数

本文链接：https://blog.csdn.net/aaaaacmer/article/details/44682219

版权

Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.

Pasha didn't like his present very much so he decided to change it. After his birthday Pasha spent m days performing the following transformations on his string — each day he chose integer a_i and reversed a piece of string (a segment) from position a_i to position |s| - a_i + 1. It is guaranteed that 2·a_i ≤ |s|.

You face the following task: determine what Pasha's string will look like after m days.

Input

The first line of the input contains Pasha's string s of length from 2 to 2·10⁵ characters, consisting of lowercase Latin letters.

The second line contains a single integer m (1 ≤ m ≤ 10⁵) — the number of days when Pasha changed his string.

The third line contains m space-separated elements a_i (1 ≤ a_i; 2·a_i ≤ |s|) — the position from which Pasha started transforming the string on the i-th day.

Output

In the first line of the output print what Pasha's string s will look like after m days.

Sample test(s)

Input

abcdef
1
2

Output

aedcbf

Input

vwxyz
2
2 2

Output

vwxyz

Input

abcdef
3
1 2 3

Output

fbdcea

题意是输入一个字符串，然后对字符串进行字符的调换。因为每次调换都是中间的一整段进行交换，如果直接模拟，估计会超时。所以应该要考虑一位位的进行调换。可以认为是一种简单的DP，由于数据比较小，所以可以新开一个数组b来存储不同位需要调换的次数。可以判断当b[i]为偶数的时候，不需要调换，否则就需要调换。而每进行一次调换都会影响到后面的情况，因此可以对后面一位b[i+1]++,最后一个for循环就可以输出结果了。

代码如下：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    char str[200005],c;
    int a[200005],i,j,b[200005],m,l,k,f;
    while(scanf("%s",str)!=EOF)
    {
        f=0;k=0;
      scanf("%d",&m);
      l=strlen(str);
      for(i=0;i<m;i++)
      scanf("%d",&a[i]);
      sort(a,a+m);
      if(a[0]==a[m-1]){
        for(i=0;i<m;i++)
        f++;
        if(f%2==1){
            for(i=a[0];i<=l/2;i++)
                {c=str[i-1];str[i-1]=str[l-i];str[l-i]=c;}
          }
          printf("%s\n",str);
          continue;
    }
    for(i=0;i<l;i++)
    b[i]=0;
      if(m>1) 
        {
          for(i=0;i<m;i++)
        {
            b[a[i]]++;
              }
              for(i=1;i<l/2;i++)
              {
                if(b[i]%2==1)
                {
                //  if(i==2)printf("1\n");
                    c=str[i-1];str[i-1]=str[l-i];str[l-i]=c;
                //  for(j=i+1;j<=l/2;j++)
                  b[i+1]++;
                  }
            }
            if(b[l/2]%2==1){
                c=str[l/2-1];str[l/2-1]=str[l-l/2];str[l-l/2]=c;
              }
        }
      
         if(m==1){
            for(i=a[0];i<=l/2;i++)
            {c=str[i-1];str[i-1]=str[l-i];str[l-i]=c;
              }
        }
        printf("%s\n",str);
    }
    return 0;
}
  据说这题的比较通用的解法是线段树，鉴于现在实力有限，只能慢慢学习，日后再来温故~~