让人春分日 哈工科教110544.立方体大作战

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, x, ans, top, stk[maxn], vis[maxn];

int main(){
    scanf("%d", &n);
    for(int i = 1; i <= n * 2; i++){
        scanf("%d", &x);
        if(!vis[x]){
            vis[x] = 1;
            stk[++top] = x;
        }
        else{
            int p;
            for(p = top; p; p--){
                if(stk[p] == x)
                    break;
            }
            ans += top - p;
            for(; p < top; p++){
                stk[p] = stk[p+1];
            }
            --top;
        }
    }
    cout << ans << endl;
}