题面

#include <bits/stdc++.h>

using namespace std;  

int minc(int n, const vector<int>& a) {  
    vector<int> dp(n + 1, INT_MAX);  
    dp[0] = 0;

    for (int i = 1; i <= n; ++i) {  
        map<int, int> freq;
        int cnt = 0;  

        for (int j = i - 1; j >= 0; --j) {  
            if (freq[a[j]] == 0) {  
                cnt++;  
            }  
            freq[a[j]]++;

            dp[i] = min(dp[i], dp[j] + cnt * cnt);  
        }  
    }  

    return dp[n];  
}  

int main() {  
    int n;  
    cin >> n;  
    vector<int> a(n);  
    for (int i = 0; i < n; ++i) {  
        cin >> a[i];  
    }
    
    cout << minc(n, a) << endl;  

    return 0;  
}