3.2.cpp

来自「作品：算法设计课程作业 作者：陈兴 学号：J04120010 操作」· C++ 代码 · 共 55 行

#include <stdio.h>
#include <stdlib.h>

void get_max_inc_sub_seq(int *piSeqs, int n, int *piStart, int *piEnd)
{
    *piStart = 0;
    *piEnd = 0;
    int iStart = 0;
    int iEnd = 1;
    for (; iEnd <= n; iEnd++)
    {
        if (iEnd == n || piSeqs[iEnd] < piSeqs[iEnd - 1])
        {
            if (iEnd - iStart > *piEnd - *piStart)
            {
                *piStart = iStart;
                *piEnd = iEnd;
            }
            iStart = iEnd;
        }
    }
}

int main()
{
    int n, i;
    char szBuf[80];
    int *piSeqs;

    //input
    printf("输入N: ");
    scanf("%d", &n);
    printf("输入数字:\n");
    piSeqs = (int *)malloc(sizeof(int)*n);
    for (i = 0; i < n; i++)
    {
        scanf("%d", &piSeqs[i]);
    }
    fgets(szBuf, 80, stdin);

    //compute
    int iStart, iEnd;
    get_max_inc_sub_seq(piSeqs, n, &iStart, &iEnd);
    //output
    printf("结果为 :\n");
    for (i = iStart; i < iEnd; i++)
    {
        printf("%d ", piSeqs[i]);
    }
    printf("\n");
    //free
    free(piSeqs);
    getchar();
    return 0;
}