Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

附代码，哪位大牛能帮忙解答下？

Posted by wolfshow at 2006-12-25 10:01:53 on Problem 2386
In Reply To:把JAVA代码改成C++的,就可以AC，JAVA就RE，难道JAVA的栈有问题？ Posted by:wolfshow at 2006-12-25 09:40:21

import java.util.*;
import java.io.*;
public class Main
{
	public static char[][] pool = new char[128][128];
	public static boolean[][] f = new boolean[128][128];
	public static int[] dr = {-1,-1,-1,0,1,1,1,0};
	public static int[] dc = {-1,0,1,1,1,0,-1,-1};
	public static int r,c;
	public static void main(String args[]) throws IOException
	{
		//FileReader fin = new FileReader("1.txt");
		Scanner cin = new Scanner(System.in);
		//while(cin.hasNext())
		{
			r = cin.nextInt();
			c = cin.nextInt();
		//	if(r == 0 && c == 0) break;
			for(int i = 0; i < r; i++)
			{
				String s = cin.next();
				pool[i] = s.toCharArray();
				//System.out.println(pool[i]);
			}
			int count = 0;
			for(int i = 0; i < r; i++)
				for(int j = 0; j < c; j++)
					f[i][j] = false;
			for(int i = 0; i < r; i++)
				for(int j = 0; j < c; j++)
				{
					if(pool[i][j] == 'W' && !f[i][j])
					{
						DFS(i,j);
						count++;
					}
				}
			System.out.println(count);
		}
	}
	public static void DFS(int rr,int cc)
	{
		f[rr][cc] = true;
		for(int i = 0; i < 8; i++)
		{
			int tr = rr + dr[i];
			int tc = cc + dc[i];
			if(tr >= 0 && tr < r && tc >= 0 && tc < c)
			{
				if(pool[tr][tc] == 'W' && !f[tr][tc])
				{
					DFS(tr,tc);
				}
			}
		}
	}
}

Followed by:

经过检查数据，应该是JVM的默认栈设置较小，导致了StackOverflowError (0) wolfshow 2006-12-25 12:30:51
- 经我测试，JVM默认最多栈数为12511 (0) tongcx 2006-12-25 12:42:26
  - 不过，我用C++测，也只有11733，可能和机子有关 (0) tongcx 2006-12-25 12:48:00
    - 那应该如何呢？ (22) wolfshow 2006-12-25 13:37:03
    - Re:不过，我用C++测，也只有11733，可能和机子有关 (18) wolfshow 2006-12-25 13:38:29
      - 有没有在程序中添加类似编译选项的东西，以扩大JAVA栈的使用量 (0) wolfshow 2006-12-25 15:54:34
        开个thread吧，这样栈会大一些 (0) frkstyc 2006-12-25 17:13:47
        Re:开个thread吧，这样栈会大一些 (8) wolfshow 2006-12-25 17:18:55
        开thread之后，还是会栈溢出，就没有什么别的办法么？ (0) wolfshow 2006-12-26 16:02:33
        Re:开thread之后，还是会栈溢出，就没有什么别的办法么？ (17) Iambitious 2007-03-23 12:17:55

Post your reply here:

User ID:
Password:
Title:

Content:

> import java.util.*;
> import java.io.*;
> public class Main
> {
> 	public static char[][] pool = new char[128][128];
> 	public static boolean[][] f = new boolean[128][128];
> 	public static int[] dr = {-1,-1,-1,0,1,1,1,0};
> 	public static int[] dc = {-1,0,1,1,1,0,-1,-1};
> 	public static int r,c;
> 	public static void main(String args[]) throws IOException
> 	{
> 		//FileReader fin = new FileReader("1.txt");
> 		Scanner cin = new Scanner(System.in);
> 		//while(cin.hasNext())
> 		{
> 			r = cin.nextInt();
> 			c = cin.nextInt();
> 		//	if(r == 0 && c == 0) break;
> 			for(int i = 0; i < r; i++)
> 			{
> 				String s = cin.next();
> 				pool[i] = s.toCharArray();
> 				//System.out.println(pool[i]);
> 			}
> 			int count = 0;
> 			for(int i = 0; i < r; i++)
> 				for(int j = 0; j < c; j++)
> 					f[i][j] = false;
> 			for(int i = 0; i < r; i++)
> 				for(int j = 0; j < c; j++)
> 				{
> 					if(pool[i][j] == 'W' && !f[i][j])
> 					{
> 						DFS(i,j);
> 						count++;
> 					}
> 				}
> 			System.out.println(count);
> 		}
> 	}
> 	public static void DFS(int rr,int cc)
> 	{
> 		f[rr][cc] = true;
> 		for(int i = 0; i < 8; i++)
> 		{
> 			int tr = rr + dr[i];
> 			int tc = cc + dc[i];
> 			if(tr >= 0 && tr < r && tc >= 0 && tc < c)
> 			{
> 				if(pool[tr][tc] == 'W' && !f[tr][tc])
> 				{
> 					DFS(tr,tc);
> 				}
> 			}
> 		}
> 	}
> }

Home Page Go Back To top