Submission #1748562

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a;

int main(){
	cin >> n >> m;
	int s[100010][25]={},li[25];
	REP(i,0,n){
		cin >> a;
		s[i+1][a-1]++;
		li[a-1]++;
	}
	
	REP(i,0,n) REP(j,0,m) s[i+1][j]+=s[i][j];
	
	int dp[1<<20];
	fill(dp,dp+sizeof(dp)/sizeof(dp[0]),INF); dp[0]=0;
	REP(i,0,(1<<m)){
		int pos=0;
		REP(j,0,m) if((i>>j)&1) pos+=li[j];
		REP(j,0,m){
			if((i>>j)&1) continue;
			dp[i+(1<<j)]=min(dp[(i+(1<<j))],dp[i]+li[j]-(s[pos+li[j]][j]-s[pos][j]));
			//bitを光らせて比較する。
		}
	}
	
	cout << dp[(1<<m)-1] << endl;
	return 0;
}

Submission Info

Judge Result