Submission #871777

#	Time	Username	Problem	Language	Result	Execution time	Memory
871777		vjudge1	Sequence (APIO23_sequence)	C++17	0 / 100	2039 ms	4764 KiB

sequence

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

int sequence(int n, std::vector<int> a) {
  ll mx = 0;
  for (int i = 0; i < n; ++i)
    {
      map < int, ll > m;
      int mid = -1, mi = 0;
      for (int j = i; j >= 0; --j)
        {
          ++m[a[j]];
          if (mid == -1) mid = a[j];
          if (a[j] < mid) ++mi;
          if ((i - j + 1) / 2 < mi) mid = prev (m.find (mid))->first, mi -= m[mid];
          if (mi + m[mid] <= (i - j + 1) / 2) mi += m[mid], mid = next (m.find (mid))->first;
          ll ans = m[mid];
          if (mi + m[mid] <= (i - j + 2) / 2)
            ans = max (ans, next (m.find (mid))->second);
          mx = max (mx, ans);
        }
    }
  return mx;
}

• 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