序列变换
Accepts: 695
Submissions: 3322
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
最长非严格单调递增子序列。
#include <stdio.h>
int GetPosition(int c[], int len, int i, int X[])
{
int start = 1;
int end = len;
while (start <= end)
{
int mid = (start + end) / 2;
if (X[c[mid]] <= X[i]) {
start = mid + 1;
}
else {
end = mid - 1;
}
}
return start;
}
int LongestIncreasingSubsequence(int X[], int n)
{
int c[n], path[n];
c[0] = -1;
c[1] = 0;
int line[n];
line[0] = c[0];
int len = 1;
for (int i = 1; i < n; ++i)
{
int index = GetPosition(c, len, i, X);
line[i] = c[index - 1];
c[index] = i;
if (index > len) {
len = index;
}
}
path[0] = c[len];
int i = 0;
while (line[path[i]] != -1)
{
path[i + 1] = line[path[i]];
++i;
}
return len;
}
int main() {
int T,i,j,it;
scanf("%d", &T);
for(i = 1; i <= T; i++) {
int N;
scanf("%d", &N);
int a[N];
for(j = 0; j < N; j++) {scanf("%d", a+j);a[j]-=j;};
int r = LongestIncreasingSubsequence(a, N);
printf("Case #%d:\n",i);
printf("%d\n", N - r);
}
return 0;
}