contests/05-05-2022(Div.3)/B/B.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

#include<bits/stdc++.h> 

using namespace std;

bool isIncreasing(vector<int> v){
  for(int i = 0; i < v.size() - 1; i++) {
    if(v[i] >= v[i+1]) {
      return false;
    }
  }
  return true;
}
int getIndex(vector<int> v){
  int index;
  for(int i = 0; i < v.size(); i++) {
    vector<int> v2(i+1);
    for(int j = 0; j <= i;j++){
      index = j;
      v2[j] = v[j];
    }
    if(!isIncreasing(v2)) {
      return index;
    }
  }
  return -1;
}

int main () {
  int tt, n;
  cin >> tt;
  while(tt--) {
    cin >> n;
    vector<int> v(n);
    for(auto &x : v) {
      cin >> x;
    }
    int idx = getIndex(v);
    vector<int> rem(v.size() - idx);
    if(idx == -1) {
      cout << "0" << endl;
    } else {
      for(int i = 0;i < v.size() - idx; i++) {
        rem[i] = v[idx + i];
      }
    }
  }

}