反蝴蝶效应
反蝴蝶效应
https://ac.nowcoder.com/acm/problem/14131
include
using namespace std;
int main()
{
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int max=a[n-1]; while(i>0) { if(max>=a[i-1]) max=max+1; else max=a[i-1]; i--; } cout<<max<<endl;
}