n^2,没加任何优化,莫名其妙就过了...

#include <iostream>
using namespace std;
long long n,z1[100003]={0x3f3f3f3f},sum1,z2[100003],sum2,p;
int main()
{
	while(cin>>n)
	{
		if(n<=z1[sum1])  z1[++sum1]=n;
		else
		{
			for(p=1;p<=sum1;p++)  if(z1[p-1]>=n&&n>z1[p])  break;
			z1[p]=n;
		}
		if(n>z2[sum2])  z2[++sum2]=n;
		else
		{
			for(p=1;p<=sum2;p++)  if(z2[p-1]<n&&n<z2[p])  break;
			z2[p]=n;
		}
	}
	cout<<sum1<<endl<<sum2;
	return 0;
}