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

Re:嘿嘿,第一次Accepted,本人的第一道题啊!!高手们看看能不能再优化(附代码)

Posted by matman at 2007-03-29 16:40:08 on Problem 1088
In Reply To:嘿嘿,第一次Accepted,本人的第一道题啊!!高手们看看能不能再优化(附代码) Posted by:L18 at 2007-01-09 19:11:13
yours has problem with following data. your answer is 5, but it should be 6

2 7
68 71 
85 67 
34 53 
22 88 
19 98 
36 1 
8 3 

> #include<iostream>
> 
> using namespace std;
> 
> int main(void)
> {
> 	int r,c,j;
> 	cin>>r>>c;
> 	int **save=new int *[r*c];
> 	for(int i=0;i<r*c;i++)
> 	{
> 		save[i]=new int[2];
> 		save[i][0]=0;
> 		save[i][1]=0;
> 	}
> 
> 	int **a=new int *[r];
> 	int **b=new int *[r];
> 	for(i=0;i<r;i++)
> 	{
> 		a[i]=new int[c];
> 		b[i]=new int[c];
> 		for(j=0;j<c;j++)
> 		{
> 			b[i][j]=0;
> 			cin>>a[i][j];
> 			for(int k=0;k<i*c+j;k++)
> 			{
> 				if(save[k][1]>=a[i][j])
> 					break;
> 			}
> 			int count;
> 			count=i*c+j;
> 			for(;k<count;count--)
> 			{
> 				save[count][0]=save[count-1][0];
> 				save[count][1]=save[count-1][1];
> 			}
> 			save[k][0]=i*c+j;
> 			save[k][1]=a[i][j];
> 		}
> 	}
> 
> 	int all=0;
> 	int temp;
> 	for(int m=0;m<r*c;m++)
> 	{
> 		    temp=0;
> 			i=save[m][0]/c;
> 			j=save[m][0]%c;
> 			if(i-1>=0) 
> 			{
> 				if(a[i][j]>a[i-1][j]&&temp<=b[i-1][j]) temp=b[i-1][j]+1;
> 			}	
> 	        if(i+1<r)  
> 			{
> 				if(a[i][j]>a[i+1][j]&&temp<=b[i+1][j]) temp=b[i+1][j]+1;
> 			}
> 	        if(j-1>=0) 
> 			{
> 				if(a[i][j]>a[i][j-1]&&temp<=b[i][j-1]) temp=b[i][j-1]+1;
> 			}
> 	        if(j+1<c)  
> 			{
> 				if(a[i][j]>a[i][j+1]&&temp<=b[i][j+1]) temp=b[i][j+1]+1; 
> 			}
> 
> 			b[i][j]=temp;
> 			if(all<temp) all=temp;
> 	}
>      cout<<all+1<<endl;
> 	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