Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int Array[1000000];
- int searching(int A[], int);
- int main()
- {
- ios_base::sync_with_stdio(0);
- cout.tie(0);
- cin.tie(0);
- int n;
- char sign;
- cin >> n;
- for(int i=0; i<n; ++i){
- cin >> sign;
- if(sign == 'p') Array[i] = 1;
- else Array[i] = -1;
- }
- int substring = searching(Array, n);
- cout << substring;
- }
- ///////////////////////////////////////////////////
- int searching(int A[], int m)
- {
- int tmp, sufiks, maxx = 0;
- for(int i=0; i<m; ++i){
- if(maxx >= m-i){
- return maxx;
- }
- if(A[i] == 1){
- tmp = 1;
- for(int j=i+1; j<m; ++i){
- if(A[j] == 1){
- ++tmp;
- sufiks = 0;
- for(int k=j; k>=i; --k){
- if(A[k] == 1) ++sufiks;
- else{
- if(sufiks > 0){
- --sufiks;
- }
- else break;
- }
- }
- }
- else{
- if(tmp > 0){
- --tmp;
- }
- else break;
- }
- if(sufiks >= 0) maxx = max(maxx, j-i+1);
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement