hdu 5009 Paint Pearls

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\len"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\len"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define foreach(c,itr)  for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define pf              push_front
#define X               first
#define Y               second
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)			memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("out.txt","r",stdin)
#define write           freopen("out2.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-6;
const double pi = acos(-1.0);
const int maxn = 51111;

int n;
int dp[maxn];
int a[maxn];
int lpos[250];


int main(){
	while (cin >> n){
		for (int i = 1; i <= n; i++){
			//cin >> a[i];
			SS(a[i]);
		}
		int mc = sqrt(double(n));
		MM(lpos, -1);
		for (int i = 0; i <= n; i++){
			dp[i] = i;
		}
		bool ok;
		for (int i = 1; i <= n; i++){
			if (a[i] != a[i - 1]){	
				ok = false;
				for (int j = mc; j >= 1; j--){
					if (a[i] == a[lpos[j]]){
						ok = true;
						for (int k = j; k >= 1; k--){
							lpos[k] = lpos[k - 1];
						}
						lpos[0] = i;
						break;
					}
				}
				if (!ok){
					for (int j = mc; j >= 1; j--){
						lpos[j] = lpos[j - 1];
					}
					lpos[0] = i;
				}
			}
			for (int j = 1; j <= mc; j++){
				dp[i] = min(dp[i], dp[lpos[j]] + j*j);
			}
		}
		cout << dp[n] << endl;
	}
	return 0;
}