204252026-01-06 18:12:16algoproSíkság (55)cpp17Wrong answer 7/55300ms804 KiB
// UUID: 512f2307-f15e-4b93-abc4-a47cb4f8a250
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	vector<int>v(n);
	for(int i=0; i<n; i++){
		cin>>v[i];
	}
	int k=0, szam=0, kezd=0;
	for(int i=0; i<n; i++){
		k=i;
		int masik=v[i];
		while(k<n-1 && (v[k+1] == v[i] || v[k+1] == masik)){
			if(k<n-2 && (v[i]-1 == v[k+2] || v[i]+1 == v[k+2])){
				masik=v[k+2];
			}
			k++;
		}
		if(szam < (k-i+1)){
			szam=k-i+1;
			kezd=i+1;
		}

	}
	cout<<szam<<" "<<kezd;

}
SubtaskSumTestVerdictTimeMemory
base7/55
1Accepted0/01ms316 KiB
2Wrong answer0/025ms316 KiB
3Accepted2/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/21ms500 KiB
9Wrong answer0/32ms316 KiB
10Wrong answer0/354ms436 KiB
11Wrong answer0/33ms436 KiB
12Accepted3/3109ms436 KiB
13Wrong answer0/334ms804 KiB
14Time limit exceeded0/3300ms568 KiB
15Time limit exceeded0/3287ms564 KiB
16Time limit exceeded0/3300ms756 KiB
17Time limit exceeded0/3277ms564 KiB
18Time limit exceeded0/3280ms564 KiB
19Time limit exceeded0/3275ms564 KiB
20Time limit exceeded0/3300ms568 KiB
21Time limit exceeded0/3266ms564 KiB
22Time limit exceeded0/3284ms584 KiB