제출 #752936

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
752936		I_love_Hoang_Yen	서열 (APIO23_sequence)	C++17	0 / 100	2033 ms	10084 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
#define SZ(s) ((int) ((s).size()))
using namespace std;

int sequence(int n, std::vector<int> a) {
    int res = 0;
    int ln = *max_element(a.begin(), a.end());
    for (int median = 0; median <= ln; ++median) {
        vector<int> cnt_less(n, 0);
        vector<int> cnt_equal(n, 0);
        vector<int> cnt_greater(n, 0);
        for (int i = 0; i < n; ++i) {
            cnt_less[i] = a[i] < median;
            cnt_equal[i] = a[i] == median;
            cnt_greater[i] = a[i] > median;
        }
        std::partial_sum(cnt_less.begin(), cnt_less.end(), cnt_less.begin());
        std::partial_sum(cnt_equal.begin(), cnt_equal.end(), cnt_equal.begin());
        std::partial_sum(cnt_greater.begin(), cnt_greater.end(), cnt_greater.begin());

        for (int l = 0; l < n; ++l) {
            for (int r = l + 1; r < n; ++r) {
                int less = cnt_less[r] - (l == 0 ? 0 : cnt_less[l-1]);
                int equal = cnt_equal[r] - (l == 0 ? 0 : cnt_equal[l-1]);
                int greater = cnt_greater[r] - (l == 0 ? 0 : cnt_greater[l-1]);

                if (less + equal >= greater && less < equal + greater) {
                    res = max(res, r - l + 1);
                }
            }
        }
    }
    return res;
}

• 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