#include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
char a[200010];
int num[200010];
int main(){
gets(a);
int n;
scanf("%d",&n);
int len = strlen(a);
for(int i = 0;i < n ;i++){
scanf("%d",&num[i]);
num[i]--;
}
sort(num,num+n);
num[n] = (len+1)/2;
for(int i = n-1;i >= 0;i--){
if(!(i&1)){
for(int j = num[i];j < (num[i+1]); j++){
swap(a[j],a[len-j-1]);
}
}
}
puts(a);
putchar('\n');
return 0;
}
codeforces 525B Pasha and String
最新推荐文章于 2020-03-02 09:45:18 发布