제출 #981930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981930		Maaxle	서열 (APIO23_sequence)	C++17	0 / 100	2036 ms	6072 KiB

sequence

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

#define range(it, a, b) for (ll it = a; it < b; it++)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>

using namespace std;

int sequence(int N, vector<int> A) {
  int maxi = 0;
  
  map<int, int> freq;
  range(l, 0, N) {
    freq.clear();
    range(r, l, N) {
      freq[A[r]]++;
      int sz = r-l+1;
      int a = sz/2, b = a+(sz&1);

      int pos = -1;
      for (auto& it : freq) {
        pos += it.second;
        if (pos >= a) {
          // cout << it.first << ' '<<it.second<<'\n';
          maxi = max(maxi, it.second);
        }   
        if (pos >= b) {
          // cout << it.first << ' '<<it.second<<'\n';
          maxi = max(maxi, it.second);
          break;
        }
      }
    }
  }
  return maxi;
}

• 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