/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 17ms 548.0 KiB
#3 Accepted 5ms 540.0 KiB
#4 Accepted 4ms 772.0 KiB
#5 Accepted 5ms 540.0 KiB
#6 Accepted 7ms 796.0 KiB
#7 Accepted 6ms 756.0 KiB
#8 Accepted 6ms 704.0 KiB

Code

#include<bits/stdc++.h>
using namespace std; 
char nl = '\n';
using i64 = long long;

void solve(int t) {
    // cout << "test #" << t << nl;
    int n; cin >> n;
    string str; cin >> str;
    int mx = 0, cur = 0;
    for (int i = 0; i < n; i++) {
        mx = max(mx, cur);
        if (str[i] == '0') cur++;
        else {
            cur = 0;
        }
    }
    mx = max(mx, cur);
    cout << mx << nl;
}   

int main() {
    int tt = 1;
    cin >> tt;
    for(int t = 1; t <= tt; t++) solve(t);
}

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:45:30
Judged At
2024-11-05 14:45:30
Judged By
Score
100
Total Time
17ms
Peak Memory
796.0 KiB