/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 7ms 560.0 KiB
#3 Accepted 7ms 564.0 KiB
#4 Accepted 7ms 556.0 KiB
#5 Accepted 7ms 560.0 KiB
#6 Accepted 7ms 540.0 KiB
#7 Accepted 7ms 564.0 KiB
#8 Accepted 7ms 560.0 KiB
#9 Accepted 3ms 564.0 KiB
#10 Accepted 3ms 540.0 KiB
#11 Accepted 6ms 560.0 KiB
#12 Accepted 6ms 564.0 KiB
#13 Accepted 6ms 568.0 KiB
#14 Accepted 6ms 560.0 KiB
#15 Accepted 6ms 540.0 KiB
#16 Accepted 7ms 568.0 KiB
#17 Accepted 7ms 560.0 KiB

Code

#include<bits/stdc++.h>
typedef long long   ll;
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout<<it<<" "; cout<<endl;
#define _ASRafi__   ios::sync_with_stdio(false); cin.tie(0);
using namespace std;

void solve()
{
    ll n, ans = 0;
    cin >> n;
    ll one = -1;
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        if(x == 2)
        {
            one = -1;
        }
        else if(one == -1 && x == 1)
        {
            one = i;
        }
        else if(x == 3)
        {
            if(one != -1) ans = max(ans, i - one + 1);
        }
    }
    cout << ans << endl;
    return;
}

int32_t main()
{
    _ASRafi__;
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1036 Perfect subarray
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-02 15:52:20
Judged At
2024-03-02 15:52:20
Judged By
Score
100
Total Time
7ms
Peak Memory
568.0 KiB