Codeforces 598B Queries on a String 【水题】
来源:互联网 发布:龙蛇演义 知乎 编辑:程序博客网 时间:2024/05/20 18:54
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.
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.
Print the resulting string s after processing all m queries.
abacaba23 6 11 4 2
baabcaa
The sample is described in problem statement.
题意:给定一个字符串s,下标从1 - |s|。
有m次操作,L R k - 表示讲[L, R]里面的字符右移k次,第R位右移一次到达第L位。问你经过m次变化后的字符串。
思路:优化区间长度k % (R-L+1)。先从后向前扫一遍,求出当前位置i经过k次变化后到达的位置。最后从前向后扫一遍,更新字符即可。时间复杂度O(m|s|)。
AC代码:
#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <algorithm>#include <queue>#include <stack>#include <map>#include <vector>#define INF 0x3f3f3f3f#define eps 1e-4#define MAXN (10000+10)#define MAXM (1000000)#define Ri(a) scanf("%d", &a)#define Rl(a) scanf("%lld", &a)#define Rf(a) scanf("%lf", &a)#define Rs(a) scanf("%s", a)#define Pi(a) printf("%d\n", (a))#define Pf(a) printf("%lf\n", (a))#define Pl(a) printf("%lld\n", (a))#define Ps(a) printf("%s\n", (a))#define W(a) while(a--)#define CLR(a, b) memset(a, (b), sizeof(a))#define MOD 100000007#define LL long long#define lson o<<1, l, mid#define rson o<<1|1, mid+1, r#define ll o<<1#define rr o<<1|1using namespace std;char str[MAXN], Cstr[MAXN];bool vis[MAXN];int main(){ Rs(str); int m; Ri(m); while(m--) { int l, r, k; Ri(l); Ri(r); Ri(k); int len = (r - l + 1); k %= len; CLR(vis, false); for(int i = r-1; i >= l-1; i--) { int pos = (i - l + 1 + k) % len + l-1; Cstr[pos] = str[i]; } for(int i = l-1; i <= r-1; i++) str[i] = Cstr[i]; } Ps(str); return 0;}
- Codeforces 598B Queries on a String 【水题】
- Codeforces 598B Queries on a String 【思维】
- [杂题] Codeforces #598B. Queries on a String
- coderforce 598B Queries on a String
- Educational Codeforces Round 1 B. Queries on a String
- Educational Codeforces Round 1 B. Queries on a String
- Educational Codeforces Round 1 B.Queries on a String(模拟)
- Codeforces 598B Queries on a String(rotate(begin,mid,end))
- 【Educational Codeforces Round 1B】【字符串平移 水题】Queries on a String 字符串平移水题
- CF--B - Queries on a String
- Coderforces 598.B Queries on a String
- Educational Codeforces Round 1 B. Queries on a String(字符串简单操作)
- codeforces - Queries on a String(模拟+取余)
- codeforces_598B. Queries on a String
- CodeForces 598BQueries on a String
- Codeforces 624B Making a String 【水题】
- B - Making a String-----CodeForces 624B
- codeforces B. Processing Queries【模拟】
- c语言之多级指针理解一
- php的安装配置
- Hibernate mapping resource cannot be opened because it does not exist in a Spring + Hibernate Maven
- [1089]:A+B for Input-Output Practice (I)
- C语言实现动态数组大小
- Codeforces 598B Queries on a String 【水题】
- Sublim Text2 安裝 Package Control 和 Ctags插件的方法
- virtualbox下最小化安装centos7后上网设置 不能上网
- javaScript-引用类型(三)
- SpringMVC4.1之Controller层最佳实践
- 对BaseAdapter和ViewHolder的封装
- python 中类的重载以及logging中的level
- 用apachebench给服务器做并发压力性能测试
- Javascript编码规范