/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 540.0 KiB
#2 Wrong Answer 15ms 924.0 KiB
#3 Wrong Answer 15ms 924.0 KiB
#4 Wrong Answer 15ms 924.0 KiB
#5 Wrong Answer 15ms 928.0 KiB
#6 Wrong Answer 15ms 924.0 KiB
#7 Wrong Answer 17ms 920.0 KiB
#8 Wrong Answer 15ms 540.0 KiB
#9 Wrong Answer 5ms 540.0 KiB
#10 Wrong Answer 5ms 540.0 KiB
#11 Accepted 14ms 932.0 KiB
#12 Accepted 14ms 924.0 KiB
#13 Accepted 14ms 936.0 KiB
#14 Accepted 14ms 924.0 KiB
#15 Wrong Answer 14ms 796.0 KiB
#16 Wrong Answer 15ms 920.0 KiB
#17 Wrong Answer 15ms 928.0 KiB

Code

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int T;
    cin >> T;
    while(T--) {
        int N;
        cin >> N;
        vector<int> arr(N);
        for(int i = 0; i < N; i++) {
            cin >> arr[i];
        }
        int maxLen = 0;
        int len = 0;
        for(int i = 0; i < N; i++) {
            if(arr[i] == 1) {
                len = 1;
            } else if(arr[i] == 2) {
                len = 0;
            } else if(arr[i] == 3 && len > 0) {
                len++;
                maxLen = max(maxLen, len);
            } else if(len > 0) {
                len++;
            }
        }
        cout << maxLen << endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1036 Perfect subarray
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-12 17:48:30
Judged At
2024-03-12 17:48:30
Judged By
Score
20
Total Time
17ms
Peak Memory
936.0 KiB