#include<cstdio>
#include<cstring>
#include<iostream>
#include<map>
#include<cmath>
//#include<windows.h>
#include<algorithm>
#include<set>
const double eps = 1e-1;
using namespace std;
typedef long long ll;
int k[90],J[90],s=1,e=1;
int main(){
int t;
while(scanf("%d",&t)!=EOF){
while(t--){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&k[i]);
for(int i=2;i<n;i++){
if(k[i]>k[i-1]&&k[i]>k[i+1])J[e++] = i-1;
else if(k[i]<k[i-1]&&k[i]<k[i+1])J[e++] = i-1;
}
if(k[1]!=k[2])s = 0,J[s] = 0;
if(k[n]!=k[n-1])J[e++] = n-1;
for(int i=s;i<e;i++){
printf("%d",J[i]);
if(i!=e-1)printf(" ");
else puts("");
}
s = e = 1;
}
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<iostr
阅读背景：
codeup1936: 打印极值点下标 模拟
来源：互联网
分享到：
