Submission #1692168

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,a[25];
vector<int> vec[25];
map<int,int> mp;

int main(){
	cin >> n;
	REP(i,1,n) cin >> a[i];
	
	RREP(i,n,1){
		REP(j,1,n){
			if(a[j]==i) vec[i].push_back(j+1);
		}
	}
	
	RREP(i,n,1){
		if(vec[i].size()){
			int ma=0,mi=INF;
			for(auto s:vec[i]) ma=max(ma,mp[s]),mi=min(mi,mp[s]);
			mp[i]=ma+mi+1;
		}else{
			mp[i]=1;
		}
	}
	
	cout << mp[1] << endl;
	return 0;
}

Submission Info

Judge Result