제출 #1129078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1129078		psm9352	서열 (APIO23_sequence)	C++20	11 / 100	2096 ms	4428 KiB

sequence

#include <vector>
#include <algorithm>
using namespace std;
int sequence(const int n,const vector<int> arr){
    int ans = 0;
    for (int l = 0;l<n;l++){
        for (int r = l+1;r<n;r++){
            vector<int> data(r-l+1);
            for (int i = l;i<=r;i++){
                data[i-l]=arr[i];
            }
            sort(data.begin(),data.end());
            int s = r-l+1;
            int mid1 = data[s/2];
            int mid2 = data[(s-1)/2];
            ans = max((int)distance(lower_bound(data.begin(),data.end(),mid1),upper_bound(data.begin(),data.end(),mid1)),ans);
            ans = max((int)distance(lower_bound(data.begin(),data.end(),mid2),upper_bound(data.begin(),data.end(),mid2)),ans);
        }
    }
    return ans;
}

• 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