This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int n,cnt=1,maxi=1;
int tim[100005];
bool tree[100005];
int main(){
cin >> n;
for(int i=1;i<=n;i++){
int a;
cin >> a;
tim[a] = i;
tree[i] = true;
}
for(int i=1;i<=n;i++){
cnt--;
if(tree[tim[i]-1]){
cnt++;
}
if(tree[tim[i]+1]){
cnt++;
}
tree[tim[i]] = false;
maxi = max(maxi,cnt);
}
cout << maxi << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |