Pancake problem
/*	TIME LIMIT - 5 */
#include<iostream.h>
#include<vector>
using namespace std;
long N;
vector<long> arr;
vector<long>::iterator it;

long process()
{
	long curr,k=0;
	while(1)
	{
		it = arr.begin();
		if(it==arr.end())
			break;
		while(it!=arr.end())
		{
			curr = *it;			
			arr.erase(it);
			while(it!=arr.end() && *it >= curr)
				it++;
		}
		k++;
	}
	return k;	
}
int main()
{
	long i,inp;
	cin>>N;
	for(i=0;i<N;i++)
	{
		cin>>inp;
		arr.push_back(inp*2);
	}
	long rv = process();
	cout << rv << "\n";
	return 0;
}
***********************************************************
/* WA - 3 */
#include<iostream.h>
#define MAX 10010
long N;
long a[MAX];

long process()
{
	long cv,sum=0,k,i;
	for(i=0;i<N;)
	{
		k=1;		
		while(i+1<N&&a[i+1]>a[i])
		{
			i++;
			k++;
		}
		cv = a[i++];
		while(i<N&&a[i]<cv)
			i++;
		sum+=k;
	}
	return sum;	
}
int main()
{
	long i;
	cin>>N;
	for(i=0;i<N;i++)
		cin>>a[i];
	long rv = process();
	cout << rv << "\n";
	return 0;
}