Submission #34517

---

Source Code Expand

#include<iostream>

using namespace std;

int main(void)
{
	int top[51];
	int towers=0;
	int n;
	int weight;
	int nearest;
	cin >> n;
	top[0]=0x7FFFFFFF;
	for(int i=0;i<n;i++)
	{
		cin >> weight;
		nearest=0;
		for(int j=1;j<=towers;j++)
		{
			if(top[nearest]>=top[j] && top[j]>=weight){
				nearest=j;
			}
		}
		if(nearest==0){
			top[++towers]=weight;
		}else{
			top[nearest]=weight;
		}
	}
	cout << towers << endl;
	return 0;
}

Submission Info

Judge Result