题意
传送门 LeeCode 1574. 删除最短的子数组使剩余数组有序
题解
考虑删除子数组的连续性,若存在满足条件的子数组,假设其索引为 [ l , r ) [l,r) [l,r),那么有原数组 [ 0 , l ) [0,l) [0,l) 以及 [ r , n ) [r,n) [r,n) 满足单调非递减性质,且有 a r r [ l − 1 ] ≤ a r r [ r ] arr[l-1]\leq arr[r] arr[l−1]≤arr[r]。预处理记录 a r r arr arr 左右两端连续区间的单调非递减性质,二分答案,复杂度 O ( n l o g n ) O(nlogn) O(nlogn)
class Solution
{
#define maxn 100005
public:
bool f1[maxn], f2[maxn];
bool judge(int x, vector<int> &arr)
{
for (int i = 0; i + x <= arr.size(); i++)
{
int l = i, r = i + x;
if (l == 0)
{
if (f2[r]) return 1;
}
else if (r == arr.size())
{
if (f1[l - 1]) return 1;
}
else
{
if (f1[l - 1] && f2[r] && arr[l - 1] <= arr[r]) return 1;
}
}
return 0;
}
int findLengthOfShortestSubarray(vector<int> &arr)
{
int n = arr.size();
f1[0] = 1;
for (int i = 1; i < n; i++)
{
if (arr[i] >= arr[i - 1]) f1[i] = 1;
if (!f1[i]) break;
}
f2[n - 1] = 1;
for (int i = n - 2; i >= 0; i--)
{
if (arr[i] <= arr[i + 1]) f2[i] = 1;
if (!f2[i]) break;
}
int lb = -1, ub = n - 1;
while (ub - lb > 1)
{
int mid = (lb + ub) >> 1;
if (judge(mid, arr)) ub = mid;
else lb = mid;
}
return ub;
}
};