hdu 5500 Reorder the Books(貪心)

題目連結：hdu 5500 Reorder the Books

代碼

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = ;

int N, A[maxn];

int main () {
    int cas;
    scanf("%d", &cas);
    while (cas--) {
        scanf("%d", &N);
        for (int i = ; i <= N; i++) scanf("%d", &A[i]);
        int ans = N;
        for (int i = N; i; i--) if (ans == A[i]) ans--;
        printf("%d\n", ans);
    }
    return ;
}