题目

思路

代码

#include<bits/stdc++.h>
typedef long long LL;using namespace std;
const int N = 100005,M = 1e9+1;
int a[N];
map<int ,int >b;
int n;
int main()
{cin >> n;for (int i = 1; i <= n; i ++ ){cin >> a[i];if(a[i]>a[i-1]){//数的大小在[a[i-1],a[i]-1]之间的所有数大小都+1b[a[i-1]]++,b[a[i]]--;}}LL sum = 0 ,res = 0;for (auto i:b ){//求前缀和sum+=i.second;res = max(res,sum);}cout << res;
}