Codeforces Round #426 (Div. 2) D 线段树优化dp

D. The Bakery

time limit per test

2.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Some time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which can bake several types of cakes, and opened the bakery.

Soon the expenses started to overcome the income, so Slastyona decided to study the sweets market. She learned it's profitable to pack cakes in boxes, and that the more distinct cake types a box contains (let's denote this number as the value of the box), the higher price it has.

She needs to change the production technology! The problem is that the oven chooses the cake types on its own and Slastyona can't affect it. However, she knows the types and order of n cakes the oven is going to bake today. Slastyona has to pack exactly k boxes with cakes today, and she has to put in each box several (at least one) cakes the oven produced one right after another (in other words, she has to put in a box a continuous segment of cakes).

Slastyona wants to maximize the total value of all boxes with cakes. Help her determine this maximum possible total value.

Input

The first line contains two integers n and k (1 ≤ n ≤ 35000, 1 ≤ k ≤ min(n, 50)) – the number of cakes and the number of boxes, respectively.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n) – the types of cakes in the order the oven bakes them.

Output

Print the only integer – the maximum total value of all boxes with cakes.

Examples

input

4 1
1 2 2 1

output

2

input

7 2
1 3 3 1 4 4 4

output

5

input

8 3
7 7 8 7 7 8 1 7

output

6

Note

In the first example Slastyona has only one box. She has to put all cakes in it, so that there are two types of cakes in the box, so the value is equal to 2.

In the second example it is profitable to put the first two cakes in the first box, and all the rest in the second. There are two distinct types in the first box, and three in the second box then, so the total value is 5.

题意：给你一个长度为n的序列 现在可以分成k部分 求每部分不同数的个数的和的最大值

题解：线段树优化dp

dp[i][j] 表示前j个分成i部分的最大值

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <bits/stdc++.h>
 #include <cstdlib>
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define LL long long
 #define mod 1000000007
 using namespace std;
 int n,k;
 int a[];
 int last[];
 int dp[][];
 map<int,int> mp;
 struct node{
     int l,r;
     int maxn;
     int add;
 } tree[];
 void buildtree(int root ,int left,int right,int p){
     tree[root].l=left;
     tree[root].r=right;
     tree[root].add=;
     tree[root].maxn=;
     if(left==right){
         tree[root].maxn=dp[p][left-];//将当前结点的最大值 初始为 前（left-1）个分成p部分的最大值
         return ;
     }
     int mid=(left+right)>>;
     buildtree(root<<,left,mid,p);
     buildtree(root<<|,mid+,right,p);
     tree[root].maxn=max(tree[root<<].maxn,tree[root<<|].maxn);
 }
 void pushdown(int root)
 {
     if(tree[root].add==) return ;
     tree[root<<].add+=tree[root].add;
     tree[root<<|].add+=tree[root].add;
     tree[root<<].maxn+=tree[root].add;
     tree[root<<|].maxn+=tree[root].add;
     tree[root].add=;
 }
 void update(int root,int left,int right,int c)
 {
     if(tree[root].l==left&&tree[root].r==right)
     {
         tree[root].add+=c;
         tree[root].maxn+=c;
         return ;
     }
     pushdown(root);
     int mid=(tree[root].l+tree[root].r)>>;
     if(right<=mid)
     {
         update(root<<,left,right,c);
     }
     else
     {
         if(left>mid)
             update(root<<|,left,right,c);
         else
         {
             update(root<<,left,mid,c);
             update(root<<|,mid+,right,c);

         }
     }
     tree[root].maxn=max(tree[root<<].maxn,tree[root<<|].maxn);
 }
 int query(int root,int left,int right)
 {
     if(left>right)
     return ;
     if(tree[root].l==left&&tree[root].r==right)
     {
         return  tree[root].maxn;
     }
     pushdown(root);
     int mid=(tree[root].l+tree[root].r)>>;
     if(right<=mid)
         return query(root<<,left,right);
     else
     {
         if(left>mid)
             return query(root<<|,left,right);
         else
            return  max(query(root<<,left,mid),query(root<<|,mid+,right));
     }
 }
 int main()
 {
     scanf("%d %d",&n,&k);
     for(int i=; i<=n; i++){
         scanf("%d",&a[i]);
         last[i]=mp[a[i]];
         mp[a[i]]=i;
     }
     for(int i=;i<=k;i++){
         buildtree(,,n,i-);//
         for(int j=;j<=n;j++){
             update(,max(last[j]+,),j,); //第j个只能在 (max(last[j]+1,1),j) 做贡献
             dp[i][j]=query(,,j);
         }
     }
     printf("%d\n",dp[k][n]);
     return ;
 }