Submission #984824

#	Time	Username	Problem	Language	Result	Execution time	Memory
984824		Muhammad_Aneeq	Sequence (APIO23_sequence)	C++17	11 / 100	2048 ms	10356 KiB

sequence

#include "sequence.h"
#include <map>
#include <vector>
#include <set>
using namespace std;
int sequence(int N,vector<int> A) 
{
  int ans=1;
  for (int i=0;i<N;i++)
  {
    multiset<int>s;
    map<int,int>cnt;
    for (int j=i;j<N;j++)
    {
      s.insert(A[j]);
      cnt[A[j]]++;
      if (s.size()%2==0)
      {
        int f=*(next(begin(s),s.size()/2));
        int g=*next(begin(s),s.size()/2-1);
        ans=max(ans,max(cnt[f],cnt[g]));
      }
      else
      {
        int f=*next(begin(s),s.size()/2);
        ans=max(ans,cnt[f]);
      }
    }
  }
  return ans;
  return 0;
}

• Subtask 1: 11 / 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