NOIP2013 Improve group T5 gardener-O (n) sweeping approach _ algorithm-other algorithms

(I was completed in 2016-7-22)

Title: Gardener-Topic

The following is my code:

#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
int n,h[100010]={0};
int p,ans=0,maxans=0; P represents the state of the previous sequence, while P = is incremented for the number of numbers, and the p=1 represents the sequence in descending

int main ()
{
  scanf ("%d", &n);
  for (int i=1;i<=n;i++) scanf ("%d", &h[i]);
  
  p = =;
  for (int i=1;i<n;i++)
  {
    if (!p&&h[i]>h[i+1]) {ans++;p =1-p;}
	if (P&&h[i]