제출 #982087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982087		vjudge1	서열 (APIO23_sequence)	C++17	28 / 100	852 ms	2097152 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;

    for(int i=0; i<n; i++){
        if(a[i]>3) sp = 0;
    }

    int ans = 0;

    if(sp){

        //unos y tres
        long long current = 0;
        int 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 = 0;
        current = 0; //dos

        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);

    }

    vector <vector <int>> repe(n+1, vector<int>(n+1));


    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            repe[i][j] = repe[i][j-1] + (a[j-1] == i);
        }
    }

    for(int i=0; i<n; i++){
        ordered_mset st;
        for(int j=i; j<n; j++){

            st.insert(a[j]);

            auto x = st.find_by_order((j-i)/2);
            auto y = st.find_by_order((j-i+1)/2);

            //cout<<i<<' '<<j<<' '<<*x<<' '<<*y<<endl;

            ans = max(ans, repe[*x][j+1]-repe[*x][i]);
            ans = max(ans, repe[*y][j+1]-repe[*y][i]);
        }
        st.clear();
    }

    return ans;

}

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