60分,其它TLE
查看原帖
60分,其它TLE
677089
MichealDantes楼主2024/8/25 16:51

应该是O(n)啊!

#include<iostream>
#include<numeric>
using namespace std;
bool a[200005];
int p[200005];
int main()
{
	int n; scanf("%d" , &n);
	for (int i = 1; i <= n; i++) scanf("%d" , &a[i]);
	iota(p , p + n + 1 , 1);
	while (p[0] <= n)
	{
		a[0] = !a[p[0]];
		for (int i = 0; i <= n; i = p[i])
		{
			int j = i;
			while (p[j] <= n && a[j] != a[p[j]])
			{
				printf("%d ", p[j]);
				j = p[j];
			}
			p[i] = p[j];
		}
		printf("\n");
	}
	return 0;
}
2024/8/25 16:51
加载中...