Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long lli;
- map<lli, int> mp;
- int main(){
- int len, k;
- scanf("%d%d", &len, &k);
- int mx = 0;
- lli sum = 0;
- mp[0] = 0;
- for(int i = 1; i <= len; ++i){
- char c;
- scanf(" %c", &c);
- if(c == 'R'){
- sum += k;
- } else if(c == 'O'){
- --sum;
- }
- map<lli, int>::iterator itr = mp.find(sum);
- if(itr == mp.end()){
- mp[sum] = i;
- } else {
- mx = max(mx, i - (itr -> second));
- }
- }
- cout << mx;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement