lintcode-397-最长上升连续子序列

397-最长上升连续子序列

思路

code

class Solution {
public:
/*
* @param : An array of Integer
* @return: an integer
*/
int longestIncreasingContinuousSubsequence(vector<int> A) {
// write your code here
int size = A.size();
if (size <= 0) {
return 0;
}
vector<int> dp(size, 0);
dp[0] = 1;
int maxLeft = dp[0];
for (int i = 1; i < size; i++) {
if (A[i] > A[i - 1]) {
dp[i] = dp[i - 1] + 1;
}
else {
dp[i] = 1;
}
maxLeft = max(maxLeft, dp[i]);
}

dp[size - 1] = 1;
int maxRight = dp[size - 1];
for (int i = size - 2; i >= 0; i--) {
if (A[i] > A[i + 1]) {
dp[i] = dp[i + 1] + 1;
}
else {
dp[i] = 1;
}
maxRight = max(maxRight, dp[i]);
}
return max(maxLeft, maxRight);
}
};