Description
Input
Output
Hint
Solution
不难发现n是一定不用拿出来的,那么最坏就是n-1次了。我们拿掉n就变成了n-1本书,这样n-1也不用拿了。但是考虑一下可以发现这样做有限制条件,那就是n-1一定要在n前面。否则就要调整他们之间的顺序了
简单地说就是找一个最长的连续上升序列且以n结尾
Code
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <queue>
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define drp(i, st, ed) for (int i = st; i >= ed; i -= 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define max(x, y) ((x)>(y)?(x):(y))
#define min(x, y) ((x)<(y)?(x):(y))
#define abs(x) ((x)<(0)?(-(x)):(x))
#define ll long long
#define ld lont double
#define db double
#define INF 0x3f3f3f3f
#define N 302001
#define E 1001
#define L 1001
int t[N];
int main(void) {
freopen("book.in","r",stdin);
freopen("book.out","w",stdout);
int T;
scanf("%d", &T);
while (T --) {
int n;
scanf("%d", &n);
rep(i, 1, n) {
scanf("%d", &t[i]);
}
int ans = n;
drp(i, n, 1) {
if (t[i] == ans) {
ans -= 1;
}
}
printf("%d\n", ans);
}
return 0;
}