Submission #60043712

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
#define deb(x) cerr << #x"=" << x << '\n'
using namespace std;
const int N = 5e5 + 5;
int n, ans, lst[N];
string s;
void Solve(){
  cin >> n >> s;
  s = ' ' + s;
  For(i, 1, n){
    if(s[i] != s[i - 1]) lst[i] = i;
    else lst[i] = lst[i - 1];
    if(s[i] == '/') ans = max(ans, 1ll);
  }
  For(i, 1, n) if(s[i] == '2'){
    int p1 = lst[i] - 1;
    if(p1 <= 1 || s[p1] != '/') continue;
    int p2 = lst[p1 - 1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
#define deb(x) cerr << #x"=" << x << '\n'
using namespace std;
const int N = 5e5 + 5;
int n, ans, lst[N];
string s;
void Solve(){
	cin >> n >> s;
	s = ' ' + s;
	For(i, 1, n){
		if(s[i] != s[i - 1]) lst[i] = i;
		else lst[i] = lst[i - 1];
		if(s[i] == '/') ans = max(ans, 1ll);
	}
	For(i, 1, n) if(s[i] == '2'){
		int p1 = lst[i] - 1;
		if(p1 <= 1 || s[p1] != '/') continue;
		int p2 = lst[p1 - 1];
		if(s[p1 - 1] != '1') continue;
		ans = max(ans, 1 + 2 * min(i - p1, p1 - 1 - p2 + 1));
	}
	cout << ans << '\n';
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T = 1; //cin >> T;
	while(T--) Solve();
	return 0;
}

Submission Info

Judge Result