[洛谷] P1893 山峰瞭望

基础模拟 

两侧爬

若

取消缓冲流同步

则

WR

//#pragma GCC optimize(2)
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstream>
#include <list>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;const int MAXN = 1e6 + 10;int arr[MAXN] = {0};int mark[MAXN] = {0};int N, ans = 0;void search(int x)
{int tans = 0;for(int i = x - 1; i > 0; i--){if(arr[i] >= arr[i - 1])tans ++;}for(int i = x; i <= N; i++){if(arr[i] >= arr[i + 1])tans ++;}ans = max(ans, tans);
}int main()
{//ios::sync_with_stdio(false);//cin.tie(0);     cout.tie(0);cin>>N;for(int i = 1; i <= N; i++)scanf("%d", &arr[i]);for(int i = 1; i <= N; i++){if(arr[i] >= arr[i - 1] && arr[i] > arr[ i + 1]){//cout<<i<<endl;search(i);}}cout<<ans<<endl;return 0;
}