Codeforce 599C Day at the Beach

Bi represents the block I, which means bi max≤bi+1 min, and because bi Min≤bi max,

So just determine if the maximum value of the prefix is less than or equal to the suffix.

#include <bits/stdc++.h>using namespaceStd;typedefLong Longll;Const intMAXN = 1e5+1;intH[MAXN], N;intMN[MAXN];//#define LOCALintMain () {#ifdef LOCAL freopen ("In.txt","R", stdin);#endifscanf ("%d", &N);  for(inti =0; I < n; i++) {scanf ("%d", H +i); } mn[n-1] = h[n-1];  for(inti = n2; I >=0; i--) {Mn[i]= Min (mn[i+1],h[i]); }    intMX = h[0], ans =1;  for(inti =1; I < n; i++){        if(MX <= mn[i]) ans++; MX=Max (h[i], MX); } printf ("%d\n", ans); return 0;}

Codeforce 599C Day at the Beach