炼金术师(思维)

https://ac.nowcoder.com/acm/contest/11169/A

---

思路:

倒序处理即可

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++) cin>>a[i];
  LL mx=a[n];
  LL ans=1;
  for(LL i=n;i>=1;i--){
     if(a[i]>mx){
        ans++;
        mx=max(mx,a[i]);
     }
  }
  cout<<ans<<"\n";
return 0;
}