AcWing:799(简单)最长连续递增不重复子序列
题目
思想
代码
#include<iostream>
#include<vector>
using namespace std;
bool check(int i, int j,const vector<int> &array) {
if (i < array.size() - 1) {
if (array[i + 1] > array[i]) return false;
else return true;
}
else
return true;
}
int main() {
int n;
cin >> n;
vector<int> array(n,0);
for (int i = 0; i < n; i++) {
cin>>array[i];
}
int currentLength = 1;
int maxLength = 1;
for (int i = 0, j = 0; i < n; i++)
{
while (j < i && check(i, j,array)) j++;
currentLength = i - j + 1;
maxLength = max(currentLength,maxLength);
}
cout << maxLength;
return 0;
}