Submission #1061299

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061299		Muhammet	Sequence (APIO23_sequence)	C++17	0 / 100	2099 ms	7368 KiB

sequence

#include <bits/stdc++.h>
#include "sequence.h"

using namespace std;

#define sz(s) (int)s.size()

int sequence(int n, vector<int> a) {
    int ans = 0;
    for(int i = 0; i < n; i++){
        vector <int> v, b(n,0);
        for(int j = i; j < n; j++){
            v.push_back(a[j]);
            b[a[j]]++;
            for(int k = sz(v)-2; k >= 0; k--){
                if(v[k] > v[k+1]){
                    swap(v[k],v[k+1]);
                }
                else {
                    break;
                }
            }
            int x = sz(v), c = (x-1)/2, c1 = (x/2);
            ans = max(ans,b[v[c]]);
            ans = max(ans,b[v[c1]]);
        }
    }
    return ans;
}

• 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