제출 #982102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982102		vjudge1	Sequence (APIO23_sequence)	C++17	0 / 100	42 ms	7516 KiB

sequence

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_mset;

int sequence(int n, vector <int> a){

    bool sp = 1;

    int ans = 0;

    if(sp){

        //unos y tres
        int current = 0, sup = 0, dos = 0;
        for(int i=0; i<n; i++){
            if(a[i] == 1){
                if(current+1>=0) {
                    current++;
                    sup++;
                }
                else {
                current=1;
                sup = 1;
                }
            }
            else current--;
            ans = max(sup, ans);
        }

        sup = current = 0;

        for(int i=0; i<n; i++){
            if(a[i] == 3){
                if(current+1>=0) {
                    current++;
                    sup++;
                }
                else {
                current=1;
                sup = 1;
                }
            }
            else current--;
            ans = max(sup, ans);
        }

        for(int i=0; i<n; i++)
            if(a[i] == 2) dos++;

        return max(dos, ans);

    } 
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18