Submission #752208

#	Time	Username	Problem	Language	Result	Execution time	Memory
752208		aryan12	Sequence (APIO23_sequence)	C++17	7 / 100	468 ms	53248 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

int sequence(int n, vector<int> a) 
{
    int pos = 0;
    vector<int> b = a;
    sort(b.begin(), b.end());
    int min_median = b[n / 2];
    for(int i = 0; i < n - 1; i++)
    {
        if(a[i] <= a[i + 1])
        {
            continue;
        }
        else
        {
            pos = i;
            break;
        }
    }
    for(int i = n - 1; i > 1; i--)
    {
        if(a[i] <= a[i - 1])
        {
            continue;
        }
        else
        {
            pos = i;
            break;
        }
    }
    map<int, int> freq1, freq2;
    for(int i = 0; i <= pos; i++)
    {
        freq1[a[i]]++;
    }
    for(int i = n - 1; i > pos; i--)
    {
        freq2[a[i]]++;
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        if(i < min_median)
        {
            ans = max(ans, max(freq1[i], freq2[i]));
        }
        else
        {
            ans = max(ans, freq1[i] + freq2[i]);
        }
    }
    return 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