Submission #982220

#	Time	Username	Problem	Language	Result	Execution time	Memory
982220		vjudge1	Sequence (APIO23_sequence)	C++17	11 / 100	2065 ms	54612 KiB

sequence

#include "sequence.h"
#include<bits/extc++.h>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
tree<int,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update> st;
multiset<int>st2;
int sequence(int N, std::vector<int> A) {
    int ans=0;
    for(int i=0;i<N;i++){
        st.clear();
        st2.clear();
        for(int j=i;j<N;j++) {
            st.insert(A[j]);
            st2.insert(A[j]);
            int A=*st.find_by_order(j-i>>1);
            int B=*st.find_by_order(j-i+1>>1);
            ans=max(ans,(int)st2.count(A));
            ans=max(ans,(int)st2.count(B));
        }
    }
    return ans;
}

Compilation message (stderr)

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:16:38: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   16 |             int A=*st.find_by_order(j-i>>1);
      |                                     ~^~
sequence.cpp:17:40: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |             int B=*st.find_by_order(j-i+1>>1);
      |                                     ~~~^~

• 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