#include<bits/stdc++.h>
using namespace std;
int n, m;
int a[100005], ls[100005], cnt, la[100005], pre[100005];
int f[100005][105], g[100005][105];
void init() {
	sort(ls + 1, ls + n + 1);
	for (int i = 1; i <= n; i++) {
		if (ls[i] != ls[i - 1]) {
			ls[++cnt] = ls[i];
		}
	}
}
int finds(int p) {
	return lower_bound(ls + 1, ls + cnt + 1, p) - ls;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		ls[i] = a[i];
	}
	init();
	for (int i = 1; i <= n; i++) {
		int p = finds(a[i]);
		if (la[p] == 0) {
			pre[i] = -1;
			la[p] = i;
		} else {
			pre[i] = la[p];
			la[p] = i;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= min(m, i); j++) {
			f[i][j] = g[i - 1][j - 1] + 1;
			if (pre[i] != -1) {
				f[i][j] = max(f[i][j], f[pre[i]][j] + 1);
			}
			g[i][j] = max(f[i][j], g[i - 1][j]);
		}
	}
	cout << g[n][m];
	return 0;
}