题意:
题目链接:http://codeforces.com/contest/606/problem/C
思路:
如果找到最长的连续递增子序列(连续指的是两个元素差为1),这一部分不动,改变剩下的,这样所需操作数最少。
代码:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
int a[MAXN], dp[MAXN];
int main() {
//freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int ans = 0;
for (int i = 1; i <= n; i++) {
dp[a[i]] = dp[a[i] - 1] + 1;
ans = max(dp[a[i]], ans);
}
printf("%d\n", n - ans);
return 0;
}