Submission #1061258

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061258		Halym2007	Sequence (APIO23_sequence)	C++17	0 / 100	56 ms	15300 KiB

sequence

#include <bits/stdc++.h>
//#include "sequence.h"
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
const int N = 5e5 + 5;

int a[N], st[N], n, val[N], sana[N];


int sequence(int N, vector<int> A) {
	n = N;
	for (int i = 0; i < n; ++i) {
		a[i] = A[i];
		val[i] = -1;
		sana[i + 1] = 0;
	}	
	int jogap = 1;
	for (int i = 0; i < n; ++i) {
		sana[a[i]]++;
		if (val[a[i]] == -1) {
			val[a[i]] = i;
			continue;
		}
		else {
			int san = i - val[a[i]] + 1;
			pii x = {(san - 1) / 2 + 1, san / 2 + 1};
			int san1 = sana[a[i]];
//			if (i == 8 and a[i] == 3) {
//				cout << san << " " << san1 << " " << sana[a[i]] << " " << x.ff;
//				exit(0);
//			}
			if (san1 >= x.ff) {
				jogap = max (jogap, sana[a[i]]);
			}
//			if (jogap == 6) {
//				cout << i << " " << a[i] << " " << val[a[i]] << " " << sana[a[i]];
//				exit(0);
//			}
		}
	}
	
	
	reverse (a + 1,a + n + 1);
	for (int i = 0; i < n; ++i) {
		val[i] = -1;
		sana[i + 1] = 0;
	}
	
	for (int i = 0; i < N; ++i) {
		sana[a[i]]++;
		if (val[a[i]] == -1) {
			val[a[i]] = i;
			continue;
		}
		else {
			int san = i - val[a[i]] + 1;
			pii x = {(san - 1) / 2 + 1, san / 2 + 1};
			int san1 = san - val[a[i]];
			if (san1 >= x.ff) {
				jogap = max (jogap, val[a[i]]);
			}
		}
	}
	
	return jogap;
}

//int main() {
//	freopen ("input.txt", "r", stdin);
//  int N;
//  assert(1 == scanf("%d", &N));
//
//  std::vector<int> A(N);
//  for (int i = 0; i < N; ++i) {
//    assert(1 == scanf("%d", &A[i]));
//  }
//  int result = sequence(N, A);
//  printf("%d\n", result);
//  return 0;
//}

• 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