/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 4ms 584.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 2ms 532.0 KiB
#5 Accepted 2ms 480.0 KiB
#6 Accepted 2ms 744.0 KiB
#7 Accepted 2ms 836.0 KiB
#8 Accepted 2ms 740.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define dq deque<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define vpp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define sort_rev sort(v.rbegin(),v.rend())
#define all_n for(int i=0;i<n;i++)
#define print for(auto it:v)cout<<it<<" "
#define print_vp for(auto it:vp)cout<<it.first<<" "<<it.second<<endl
#define print_mp for(auto it:mp) cout<<it.first<<" "<<it.second<<endl
#define scan_v for(int i=0;i<n;i++)cin>>v[i]
#define scan_a for(int i=0;i<n;i++)cin>>a[i]
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll n;
        cin>>n;
        string s;
        cin>>s;
        ll count=0;
        ll zeros=0;
        for (int i = 0; i < n; ++i) {
            if (s[i]=='0')count++;
            else{
                zeros= max(count,zeros);
                count=0;
            }
        }
        zeros= max(count,zeros);
        cout<<zeros<<endl;
    }
    return 0;
}

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:53:07
Judged At
2024-11-11 02:32:16
Judged By
Score
100
Total Time
4ms
Peak Memory
836.0 KiB