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

用char[26][26]存放点对，两重for，0ms

Posted by 15914304086 at 2012-03-27 17:54:21 on Problem 3096 
……
for (k=1;k<l-1;k++)//length
{
        memset(a,0,sizeof(a));
	for (j=0;j<l-k;j++)//start
	{
		if (a[ss[j]][ss[j+k]]==0)
			a[ss[j]][ss[j+k]]=1;
		else
			break;
	}
	if (j<l-k)
		break;
}
……
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