把数组抽象成二维图形,,,相邻的点连线,,,数组就是一条折线,,,
数一下折线上凸的点的个数,,,ans=num*2
如果最后一个点也是上凸的点,,,ans--

    for(scanf("%d",&tt);tt--;)
    {
        int n;
        scanf("%d",&n);
        int i,ans=0;
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        a[0]=a[n+1]=-(1<<29);
        for(i=1;i<=n;i++)
        {
            if(a[i]>a[i-1]&&a[i]>a[i+1])
                ans++,i++;
        }
        ans*=2;
        if(a[n]>a[n-1])
            ans--;
        printf("%d\n",ans);
    }