/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 26ms 548.0 KiB
#3 Accepted 7ms 320.0 KiB
#4 Accepted 4ms 320.0 KiB
#5 Accepted 6ms 532.0 KiB
#6 Accepted 6ms 700.0 KiB
#7 Accepted 6ms 848.0 KiB
#8 Accepted 6ms 680.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 1;
const int mxn = 1e3 + 3, mod = 1e9 + 7;

int32_t main()
{
    //fast;
   w(t)
   {
       int n;
       cin >> n;
       string s;
       cin >> s;
       for(int i = 0; i < n; i++)if(s[i] == '1')s[i] = '0';else s[i] = '1';
       int ans = 0;
       for(int i = 0; i < n;)
       {
           int j = i, cnt = 0;
           while(i < n and s[j] == s[i])cnt++, i++;
           if(s[j] == '1')ans = max(ans, cnt);
       }
       cout << ans << endl;
   }


}

Information

Submit By
Type
Submission
Problem
P1113 Fliping Game
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 14:47:52
Judged At
2024-11-11 02:32:30
Judged By
Score
100
Total Time
26ms
Peak Memory
848.0 KiB