-
Notifications
You must be signed in to change notification settings - Fork 29
/
Copy paths10e.cpp
56 lines (50 loc) · 760 Bytes
/
s10e.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
49
50
51
52
53
54
55
56
#include<iostream>
#include<vector>
using namespace std;
bool isGoodDay(vector<int> vec, int day){
if(day<=5){
for(int i=day-1;i>=0;i--){
if(vec[i]>vec[day]){
continue;
}
else{
return false;
}
}
return true;
}
else{
for(int i=1;i<6;i++){
if(vec[day-i]>vec[day]){
continue;
}
else{
return false;
}
}
return true;
}
}
int main(){
int testcases;
cin>> testcases;
for(int j=0;j< testcases;j++){
vector<int> days;
int n;
int goodDays=1;
cin >> n;
for(int i=0;i<n;i++){
int push;
cin>>push;
days.push_back(push);
}
for(int i=1;i< days.size();i++){
// cout<<isGoodDay(days,i)<<endl;
if(isGoodDay(days,i)){
goodDays+=1;
}
}
cout<< goodDays<< endl;
}
return 0;
}