九度教程--------19

九度教程第十九题

#include <stdio.h>
int main() {
	int n,array[1000],b[1000];
	while(~scanf("%d",&n))
	{
		for(int i = 0;i < n;i ++) {
			int x,ct;
			ct = 0;
			scanf("%d",&x);
		for(int i = 0;i < x;i ++) 
		{
			scanf("%d",&array[i]);
			b[i] = 0;
		}

	
     	for(int i =1;i <= x - 2;i ++)
		    if((array[i] > array[i - 1] && array[i] > array[i+1])||(array[i] < array[i - 1] && array[i] < array[i+1]))
				  b[++ ct] = i;
			  
	
		if(array[0] != array[1] && ct == 0 && array[x - 1] ==  array[x - 2])
		{
			printf("%d",0);
		
		}	
	    if(array[0] != array[1]&& (ct != 0 || array[x - 1] !=  array[x - 2] ))
			printf("%d ",0);
		if(ct != 0)
		{
			for(int i = 1;i <= ct - 1;i ++)
					printf("%d ",b[i]);
  			printf("%d",b[ct]);
		}
		if(array[x - 1] !=  array[x - 2] && (ct != 0 || array[0] != array[1]))
		{
			if(ct == 0)
			printf("%d",x - 1);
			else 
			printf(" %d",x - 1);
		
		}	
		if(array[x - 1] !=  array[x - 2] && ct == 0 && array[0] == array[1])
		printf("%d",x - 1);
  		printf("\n");
		

		}
	}
	return 0;
}