Submission #981954

#	Time	Username	Problem	Language	Result	Execution time	Memory
981954		alo_54	Sequence (APIO23_sequence)	C++17	0 / 100	2035 ms	4188 KiB

sequence

#include "sequence.h"

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

int techo(int k)
{
  if (k % 2 == 0)
  {
    return k /2;
  }

  return (k/2) + 1;
  
}

int sequence(int N, std::vector<int> A) 
{

  int maxV = -1;

  for (int i = 0; i < N-1; i++)
  {
    for (int j = i + 1; j < N; i++)
    {
      vector <int> arr;

      for (int k = i; k <= j; k++)
      {
        arr.push_back(A[k]);
      }

      sort(arr.begin(), arr.end());

      int p = arr.size()/2;
      int t = techo(arr.size());

      maxV = max(maxV, max(arr[p], arr[t]));
      
  
    }
    
  }

  return maxV;
  
}

• 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