/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 412.0 KiB
#2 Accepted 5ms 796.0 KiB
#3 Accepted 5ms 796.0 KiB
#4 Accepted 5ms 796.0 KiB
#5 Accepted 5ms 828.0 KiB
#6 Accepted 5ms 796.0 KiB
#7 Accepted 5ms 796.0 KiB
#8 Accepted 5ms 412.0 KiB
#9 Accepted 2ms 412.0 KiB
#10 Accepted 2ms 412.0 KiB
#11 Accepted 5ms 796.0 KiB
#12 Accepted 4ms 796.0 KiB
#13 Accepted 4ms 796.0 KiB
#14 Accepted 4ms 796.0 KiB
#15 Accepted 4ms 796.0 KiB
#16 Accepted 4ms 796.0 KiB
#17 Accepted 4ms 796.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
const long long M=3e5+10,MOD=1000000007;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    cin>>t;
    while(t--){
    
     int ans=0;
     int n;
     cin>>n;
     vector<int>s(n);
     for(auto &i:s)cin>>i;
    
     for(int i=0;i<n;i++){
        int l=i;
        if(s[i]==1){
            while(l<n){
                 if(s[l]==2){
                    break;
                 }
                 else if(s[l]==3){
                    ans=max(ans,l-i+1);
                 }
                 l++;
            }
            i=l;
        }
     }
     cout<<ans<<"\n";
     
 }


    
    return 0;
 
}

Information

Submit By
Type
Submission
Problem
P1036 Perfect subarray
Contest
Brain booster #2
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-06 13:15:28
Judged At
2024-03-06 13:15:28
Judged By
Score
100
Total Time
5ms
Peak Memory
828.0 KiB