Submission #1411390

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<cstring>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

const int N = 210;
const int INF = 1e+9;

int n,m;
int t[N];
int a[N];
int f[N];

int main(){
	n=get();m=get();
	fo(i,1,n)t[a[i]=get()]++;
	fo(cas,1,m){
		int x=get(),y=get();
		t[a[x]]--;
		t[a[x]=y]++;
		fo(i,0,n)f[i]=0;
		f[0]=0;
		fo(i,0,n)
			fo(j,i+1,n){
				f[j]=max(f[j],f[i]+min(j-i,t[j]));			
			}
		printf("%d\n",n-f[n]);
	}
	return 0;
}

Submission Info

Judge Result