Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

暴力破解,为什么不给过,求解,大侠们啊

Posted by xixiaoxi at 2011-07-07 11:40:36
#include<iostream>
using namespace std;
int main()
{
	int N,m,n,l=0,*a,length,flag,i,j;
	while((scanf("%d",&N))!=EOF)
	{
	    a=new int[5];
		for(i=0;i<N;i++)
			cin>>*(a+i);
		flag=0;l=0;length=-1;
		for(m=0;m<N;m++)
		{
			for(n=N-1;n>m;n--)
			{
				if(*(a+m)<*(a+n))
				{
				for(j=m+1;flag!=1&&j<=n;j++)
					if(*(a+m)>*(a+j)||*(a+n)<*(a+j))
						flag=1;
				
				if(flag==0)  
				{
				l=n-m;
				if(l>length)
					length=l;
				}
				flag=0;
				}
			}
		}
		cout<<length<<endl;
		delete [] a;
	}
	return 0;
}



		

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator