Submission #34240

---

Source Code Expand

#include <iostream>
using namespace std;

int n;
int in[51];
int maxin[51];

int main() {
    cin>>n;
    for(int i=0; i<n; ++i) cin>>in[i];

    int ans = 0;
    while(true) {
        maxin[n-1] = in[n-1];
        for(int i=n-2; i>=0; --i)
            maxin[i] = max(maxin[i+1], in[i]);

        if(maxin[0] == -1) break;
        for(int i=0; i<n; ++i)
            if(in[i] == maxin[i]) in[i] = -1;
        ans++;
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result