Accepted
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-11-11 03:42:45
- Judged By
- Score
- 100
- Total Time
- 8ms
- Peak Memory
- 1020.0 KiB