LibreOJ #507. 「LibreOJ NOI Round #1」接竹竿

二次联通门 : LibreOJ #507. 「LibreOJ NOI Round #1」接竹竿

/*
    LibreOJ #507. 「LibreOJ NOI Round #1」接竹竿

    dp
    记录一下前驱就好了
    再随便用前缀和优化一下
    O(N)

*/
#include <iostream>
#include <cstdio>

const int BUF = ;
char Buf[BUF], *buf = Buf;

inline long long max (long long a, long long b)
{
    return a > b ? a : b;
}

void read (int &now)
{
    for (now = ; !isdigit (*buf); ++ buf);
    for (; isdigit (*buf); now = now *  + *buf - '', ++ buf);
}

#define Max 1000020
int N, K;
long long sum[Max];

int to[Max];
int last_kind[Max * ];

long long dp[Max];

int main (int argc, char *argv[])
{
    fread (buf, , BUF, stdin);
    read (N);
    read (K);

    register int i;
    int x;
    for (i = ; i <= N; ++ i)
    {
        read (x);
        to[i] = last_kind[x];
        last_kind[x] = i;
    }

    for (i = ; i <= N; ++ i)
    {
        read (x);
        sum[i] = sum[i - ] + x;
    }

    register int res;
    for (i = ; i <= N; ++ i)
    {
        dp[i] = dp[i - ];
        if (to[i])
            dp[i] = max (dp[i], max (dp[to[i]] + sum[i] - sum[to[i]], dp[to[i] - ] + sum[i] - sum[to[i] - ]));
    }  

    printf ("%lld", dp[N]);
    return ;
}