Submission #981926

#	Time	Username	Problem	Language	Result	Execution time	Memory
981926		vjudge1	Sequence (APIO23_sequence)	C++17	7 / 100	78 ms	13396 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
using ii = pair <ll, ll>;
using vii = vector <ii>;

int sequence (int n, vi ve) {
    for (int &i : ve) i--;
    vi v2 = ve;
    sort(v2.begin(), v2.end());
    ll med = v2[(n-1)/2];
    ll ans = 0;
    vll freq(n, 0);
    for (int i : ve) freq[i]++;
    for (ll i = med; i < n; i++) {
        ans = max(ans, freq[i]);
    }
    freq.assign(n, 0);
    ll i = 0;
    for (; i < n; i++) {
        if (!i || ve[i-1] <= ve[i]) {
            ans = max(ans, ++freq[ve[i]]);
        } else break;
    }
    freq.assign(n, 0);
    for (; i < n; i++) {
        if (!i || ve[i-1] >= ve[i]) {
            ans = max(ans, ++freq[ve[i]]);
        } else break;
    }
    return int(ans);
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 7 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18