forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
52 lines (47 loc) · 1.42 KB
/
A.cpp
File metadata and controls
52 lines (47 loc) · 1.42 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
int main() {
ios :: sync_with_stdio(false);
int n;
string s;
while (cin >> n >> s) {
int firstR = -1, lastR = -1;
int firstL = -1, lastL = -1;
REP(i,n) {
if (s[i] == 'R') {
if (firstR < 0) firstR = i;
lastR = i;
}
if (s[i] == 'L') {
if (firstL < 0) firstL = i;
lastL = i;
}
}
int s, t;
if (firstR < 0) {
// all L
s = lastL;
t = firstL - 1;
}
else if (firstL < 0) {
// all R
s = firstR;
t = lastR + 1;
}
else {
s = firstR;
t = lastR;
}
cout << s+1 << ' ' << t+1 << endl;
}
}