ojcode/oj1126.cpp at master · axknightroad/ojcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <stdio.h>

int n,m;
int main(){
  while(scanf("%d",&n)!=EOF)
    {
      int buf[n][80];
      for(int i=0;i<n;i++)
	{
	  scanf("%d",&m);
	  for(int j=0;j<m;j++)
	    scanf("%d",&buf[i][j]);
	  int firstFlag=1;
	  int outFlag=0;
	  for(int j=0;j<m;j++)
	    {
	      if(j==0)
		{
		  if(buf[i][j]!=buf[i][j+1])
		    outFlag=1;
		}
	      else if(j==m-1)
		{
		  if(buf[i][j]!=buf[i][j-1])
		    outFlag=1;
		}
	      else
		{
		  if(buf[i][j]>buf[i][j+1]&&buf[i][j]>buf[i][j-1]||buf[i][j]<buf[i][j+1]&&buf[i][j]<buf[i][j-1])
		    outFlag=1;
		}
	      if(outFlag==1)
		{
		  if(firstFlag==1)
		    firstFlag=0;
		  else
		    printf(" ");
		  printf("%d",j);
		  outFlag=0;
		}
	    }
	  printf("\n");
	}
    }
  return 0;
}