POJ3183

//POJ3183 代码写得很龊，但是还是可以AC，极大点的查找
#include <iostream>
using namespace std;
int main()
{
	int a[50005];
	int n;
	cin>>n;
	for(int i = 0; i < n; i++)
	{
		cin>>a[i];
	} 
	for(int i = 0; i < n; i++)
	{
		if(i + 1 == n)
		{
			cout<<i+1<<endl;
			break;
		}
		for(int j = i + 1; j < n; j++)
		{
			if(a[j] > a[j-1])
			{
				if(j + 1 == n)
				{
					cout<<j+1<<endl;
					i = n;
					break;	
				}
				continue;
			}
			cout<<j<<endl;
			for(int k = j; k < n; k++)
			{
				if(a[k] < a[k-1])
				{
					if(k + 1 == n)
					{
						i = n;
						j = n;
					 	break;
					}					
					continue;
				}
				i = k - 1;
				j = n;
				break;
			}
		}
	}
	return 0;
}