제출 #974348

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

sequence

#include <bits/stdc++.h>

using namespace std;

int sequence(int n, vector<int> a) {
    int l_max[n], l_min[n], r_max[n], r_min[n];
    for (int i = 0; i < n; i++) {
        l_max[i] = l_min[i] = r_max[i] = r_min[i] = i;
        int c1 = 0, c2 = 0;
        int Lmax = 0, Lmin = 0, Rmax = 0, Rmin = 0;
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] == a[i]) break;
            c1 += (a[j] < a[i]), c2 += (a[j] > a[i]);
            if (c1 - c2 < Lmax) Lmax = c1 - c2, l_max[i] = j;
            if (c1 - c2 < Lmin) Lmin = c1 - c2, l_min[i] = j;
        }
        int c3 = 0, c4 = 0;
        for (int j = i + 1; j < n; j++) {
            if (a[j] == a[i]) break;
            c3 += (a[j] < a[i]), c4 += (a[j] > a[i]);
            if (c3 - c4 > Rmax) Rmax = c3 - c4, r_max[i] = j;
            if (c3 - c4 < Rmin) Rmin = c3 - c4, r_min[i] = j;
        }
    }
    vector<int> pos[n + 1];
    for (int i = 0; i < n; i++) pos[a[i]].emplace_back(i);
    int l = 0, r = n + 1;
    while (r - l > 1) {
        int m = (l + r) / 2, F = 0;
        for (int val = 1; val <= n; val++) {
            for (int ind = 0; ind + m - 1 < (int) pos[val].size(); ind++) {
                int LL = pos[val][ind], RR = pos[val][ind + m - 1], L = LL, R = RR;
                int c1 = 0, c2 = 0;
                for (int i = L; i <= R; i++) c1 += (a[i] < val), c2 += (a[i] > val);
                int f1 = (L + R) / 2, f2 = (L + R + 1) / 2;
                if ((L + c1 <= f1 && f1 <= R - c2) || (L + c1 <= f2 && f2 <= R - c2)) {
                    F = 1;
                    break;
                }
            }
        }
        if (F == 1) l = m;
        else r = m;
    }
    return l;
}

//int main() {
//    ios_base::sync_with_stdio(false);
//    cin.tie(nullptr), cout.tie(nullptr);
//    int N;
//    cin >> N;
//    vector<int> A(N);
//    for (int i = 0; i < N; i++) cin >> A[i];
//    cout << sequence(N, A);
//    return 0;
//}

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

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:6:9: warning: variable 'l_max' set but not used [-Wunused-but-set-variable]
    6 |     int l_max[n], l_min[n], r_max[n], r_min[n];
      |         ^~~~~

• 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