第一个样例怎么得出来的......

#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
int g,n,i,j,l,k,a[1005];
int b[1005];
struct qwq
{
    int sum,next;
}f[10005];
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>g;
    while (g--)
    {
        memset(b,0,sizeof(b));
        cin>>n;
        for (i=1; i<=n; i++) 
        {	
            cin>>a[i];
            f[i].sum=1;
        }
        for (i=n-1; i>=1; i--)
        {
            l=0;
            for (j=i+1; j<=n; j++) 
            if (a[i]<=a[j])
                if (f[j].sum>l)
                {
                    l=f[j].sum;
                    k=j;
                }
            f[i].sum+=l;
        }
        for (i=1; i<=n; i++) 
            for (j=i+1; j<=n; j++)
            if (a[i]<=a[j]) 
                if (f[i].sum==f[j].sum+1) {b[f[i].sum]++; if (f[i].sum==11)cout<<i<<" "<<j<<endl;}
        b[1]=n;
        for (i=n; i>=1; i--) if (b[i]>0) {cout<<i<<" "<<b[i]<<endl; break;} 
    }
}