제출 #1179219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179219		KasymK	Sequence (APIO23_sequence)	C++17	28 / 100	2096 ms	4976 KiB

sequence

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int INF = 1e9;
const int N = 2e3+5;
int cnt[N];

int sequence(int n, vector<int> v){
    int answer=1;
    vector<int> A;
    for(int i = 0; i < n; ++i){
        A.clear();
        for(int j = i; j < n; ++j){
            A.pb(v[j]), cnt[v[j]]++;
            // A is sorted in history, so we do sorting on it
            int ind=(int)A.size()-1;
            while(ind>0 and A[ind-1]>A[ind])
                swap(A[ind-1], A[ind]), ind--;
            int sz=(int)A.size();
            umax(answer, cnt[A[sz/2]]);
            if(sz%2==0)
                umax(answer, cnt[A[(sz-1)/2]]);
        }
        for(int j = i; j < n; ++j)
            cnt[v[j]]--;
    }
    return answer;
}

• 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