제출 #978087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978087		Aybak	서열 (APIO23_sequence)	C++17	11 / 100	2057 ms	7712 KiB

sequence

#include <vector>
#include <iostream>
#include <cstring>

int Count(int* arr, int len, int var) {
    int out = 0;
    for (int i = 0; i < len; ++i) {
        if (arr[i] == var) {
            ++out; } }
    return out; }

int getMedianCount(int* arr, int len, int* sortedArrH) {
    memcpy(sortedArrH, arr, len * sizeof(int));
    std::qsort(sortedArrH, len, sizeof(int), [](const void* x, const void* y) { if (*(int*)x > *(int*)y) return 1; return 0; });


    if (len % 2 == 1) {
        return Count(sortedArrH, len, sortedArrH[len / 2]); }
    else {
        int M1 = Count(sortedArrH, len, sortedArrH[len / 2]);
        int M2 = Count(sortedArrH, len, sortedArrH[len / 2 - 1]);
        return std::max(M1, M2); } }


int sequence(int N, std::vector<int> A) {
    int* arr = A.data();
    int* sortedArrH = new int[N];
    int LM = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = i + 1; j < N + 1; ++j) { // array is i include j exclude
            int LMH = getMedianCount(&arr[i], j - i, sortedArrH);
            if (LMH > LM) {
                LM = LMH; } } }

    delete[] sortedArrH;
    return LM; }

• Subtask 1: 11 / 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