Submission #776981

#	Time	Username	Problem	Language	Result	Execution time	Memory
776981		Dan4Life	Sequence (APIO23_sequence)	C++17	0 / 100	44 ms	8388 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define sz(a) (int)a.size()
#define fi first
#define se second
#define pb push_back
vector<pair<int,int>> v;
Tree<pair<int,int>> S;
map<int,int> tot;
int n;
int sequence(int N, vector<int> a) {
	n = N; int ans = 1;
	for(int i = 0; i < n; i++){
		int j = i;
		while(i<n-1 and a[i]==a[i+1]) i++;
		v.pb({a[i],i-j+1});
		ans = max(ans, i-j+1);
	}
	for(int i = 0; i < sz(v); i++)
		if(i+2<sz(v) and v[i].fi==v[i+2].fi) 
			ans = max(ans, v[i].se+v[i+2].se);
	return ans;
}

• 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