最大连续子序列

#include

#include

#include

using namespace std;

void handle(int *inputs,int N)

{

    int *dp = new int[N];

    int firstId[100001];

    dp[0] = inputs[0];

    for(int i=0;ib)

        {

            dp[i] = a;

            firstId[i]=1;

        }

        else

        {

            dp[i] =b;

            firstId[i]=0;

        }

    }

    int max = dp[0];

    int lastid=0;

    for(int i=0;imax)

        {

            max=dp[i];

            lastid = i;

        }

    }

    int firstid =  lastid;

    for(int i=lastid;i>=0;i--)

    {

        if(firstId[i]==1)

        {

            firstid = i;

            break;

        }

    }

    if(max