Codeforces 598B Queries on a String(rotate(begin,mid,end))

关注

原创最新推荐文章于 2021-04-20 11:00:57 发布 311 阅读 AI 写同款· GEO 优化 ›

第三节: 串口通信(用CubeMX学习STM32) 用CubeMX学习STM32, 串口通信学习, 通过轮询方式和中断方式两种方式进行通信演示。 STM32F407zgt6 阅读详情

B. Queries on a String

time limit per test 2 seconds
memory limit per test 256 megabytes
input standard input
output standard output
You are given a string s and should process m queries. Each query is described by two 1-based indices li, ri and integer ki. It means that you should cyclically shift the substring s[li… ri] ki times. The queries should be processed one after another in the order they are given.
One operation of a cyclic shift (rotation) is equivalent to moving the last character to the position of the first character and shifting all other characters one position to the right.
For example, if the string s is abacaba and the query is l1 = 3, r1 = 6, k1 = 1 then the answer is abbacaa. If after that we would process the query l2 = 1, r2 = 4, k2 = 2 then we would get the string baabcaa.
Input
The first line of the input contains the string s (1 ≤ |s| ≤ 10 000) in its initial state, where |s| stands for the length of s. It contains only lowercase English letters.
Second line contains a single integer m (1 ≤ m ≤ 300) — the number of queries.
The i-th of the next m lines contains three integers li, ri and ki (1 ≤ li ≤ ri ≤ |s|, 1 ≤ ki ≤ 1 000 000) — the description of the i-th query.
Output
Print the resulting string s after processing all m queries.
Sample test(s)
input
abacaba
2
3 6 1
1 4 2
output
baabcaa
水题循环移位

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char a[10005];
int main(){
    int n,l,r,k;
    scanf("%s",a);
    scanf("%d",&n);
    while(n--){
        scanf("%d %d %d",&l,&r,&k);
        k=k%(r-l+1);
        rotate(a+l-1,a+r-k,a+r);
    }
    printf("%s",a);
    return 0;
}