最长非连续递减子序列长度&个数

 

int a[100] = {68, 69, 54, 64, 68, 64, 70, 67, 78, 62, 98, 87};        //主序列;
int n = 1;                                                            //主序列元素个数;
int large = 1;                                                        //最长非连续递减子序列序列长度;
int num = 1;                                                        //最长非连续递减子序列序列数量;
int fun(int i, int n, int cnt)        // i开始下标; n结束下标; cnt已找到递减序列长度;
{
    if(i == n)
        return 0;

    for(int j=i+1; j<=n;j++)
    {
        if (a[i] > a[j])
        {
            //cnt++;
            fun(j, n, cnt+1);

            if (cnt+1 > large)
            {
                large = cnt+1;
                num = 1;
            }
            else if (cnt+1 == large)
            {
                num++;
            }
        }
    }
    
    return 0;
}

int _tmain(int argc, _TCHAR* argv[])
{
    for (int i=0; i<n; ++i)
    {
        fun(i, n-1, 1);
    }

    printf("\nlarge: %d \nnum:%d\n", large, num);
    return 0;
}