4
執行完我的用java寫的程序後我看到這個輸出：java result：2147483647。這個數字意味着什麼？「java result」是什麼意思？
這是代碼。它實際上應該在一個acm問題解決方案上運行隨機測試案例！沒辦法正常停止！當我手動停止它，我看到這樣的輸出：
Java結果：2147483647 BUILD SUCCESSFUL（總時間：8分49秒）
我只是想知道是什麼號碼意味着什麼？
package acm;
import java.util.Random;
import java.util.Scanner;
import java.util.Vector;
public class mamoth {
static Scanner input = new Scanner(System.in);
public static String planets;
public static int H;
public static int A;
public static Random random = new Random();
public static void main(String []args)
{
while(!(planets = /*input.nextLine()*/Integer.toString(random.nextInt(10)+1) + " " + Integer.toString(random.nextInt(10)+1)).equals("0 0")){
System.out.println(planets);
//while(!(planets = input.nextLine()).equals("0 0")){
int index;
index = planets.indexOf(' ');
H = Integer.valueOf(planets.substring(0, index));
A = Integer.valueOf(planets.substring(index+1));
Vector<Integer> humanPlanets = new Vector<Integer>();
String temp = "1 0";
for(int i=0;i<H-1;i++){
temp += " 1 0";
}
planets = /*input.nextLine()*/temp;
System.out.println(planets);
//planets = input.nextLine();
int index1 = 0;
int index2;
while((index2 = planets.indexOf(' ',index1))!=-1){
humanPlanets.addElement(Integer.valueOf(planets.substring(index1, index2)));
index1= index2+1;
}
humanPlanets.addElement(Integer.valueOf(planets.substring(index1)));
Vector<Integer> aliasPlanets = new Vector<Integer>();
temp = "0 0";
for(int i=0;i<A-1;i++){
temp += " 0 0";
}
planets = /*input.nextLine()*/temp;
System.out.println(planets);
//planets = input.nextLine();
index1 = 0;
while((index2 = planets.indexOf(' ',index1))!=-1){
aliasPlanets.addElement(Integer.valueOf(planets.substring(index1, index2)));
index1= index2+1;
}
aliasPlanets.addElement(Integer.valueOf(planets.substring(index1)));
int[][] distance = new int[H][A];
for(int i=0;i<H;i++){
temp = Integer.toString(random.nextInt(100)+1);
for(int b=0;b<A-1;b++){
temp += " " + Integer.toString(random.nextInt(100)+1);
}
planets = /*input.nextLine()*//*Integer.toString(random.nextInt(100)+1) + " " + Integer.toString(random.nextInt(100)+1) + " " + Integer.toString(random.nextInt(100)+1)*/temp;
//planets = input.nextLine();
index1 = 0;
int j =0;
while((index2 = planets.indexOf(' ',index1))!=-1){
distance[i][j] = Integer.valueOf(planets.substring(index1, index2));
index1= index2+1;
j++;
}
distance[i][j] = Integer.valueOf(planets.substring(index1));
}
if(H>=A){
int[][] minimumYearsToDefeat = new int[H][A];
for(int i=0;i<H;i++){
for(int j=0;j<A;j++){
double x,y,z;
y = aliasPlanets.elementAt(j*2) + humanPlanets.elementAt(i*2+1)*distance[i][j]-humanPlanets.elementAt(i*2);
z = humanPlanets.elementAt(i*2+1) - aliasPlanets.elementAt(j*2+1);
if(z==0){
if(y<=0)
x = distance[i][j];
else
x = Integer.MAX_VALUE;
}
else{
x = y/z;
}
if(x==0){
x=1;
}
else if(x<0){
x= Integer.MAX_VALUE;
}
minimumYearsToDefeat[i][j] = (int)Math.ceil(x);
}
}
for(int i=0;i<H;i++){
for(int j=0;j<A;j++)
System.out.print(minimumYearsToDefeat[i][j]+" ");
System.out.println();
}
int[] mins = new int[A];//meqdar dehi ba big integer
for(int i=0;i<A;i++){
mins[i] = Integer.MAX_VALUE;
}
int[] minsWith = new int[A];//meqdar dehi ba -1
for(int i=0;i<A;i++){
minsWith[i] = -1;
}
for(int i=0;i<A;i++){
for(int j=0;j<H;j++){
if(minimumYearsToDefeat[j][i]<mins[i]){
mins[i] = minimumYearsToDefeat[j][i];
minsWith[i] = j;
}
}
for(int p=0;p<A;p++){
if(minsWith[i]==minsWith[p]&&p!=i&&mins[i]!=Integer.MAX_VALUE){
correctingConflict(minimumYearsToDefeat, mins, minsWith, i, p, new Vector<Integer>());
}
}
}
int result = 0;
for(int i=0;i<A;i++){
if (mins[i]>result)
result = mins[i];
}
if(result==Integer.MAX_VALUE){
System.out.println("IMPOSSIBLE");
}
else{
System.out.println(result);
}
}
else{
System.out.println("IMPOSSIBLE");
}
}
}
public static void correctingConflict(int[][] W, int[] mins, int[] minsWith, int i, int p, Vector<Integer> vector){
/*for(int v=0;v<A;v++){
System.out.print(minsWith[v]+" ");
}
System.out.println();
for(int v=0;v<vector.size();v++){
System.out.print(vector.elementAt(v)+" ");
}
System.out.println();*/
int nextMin1 = Integer.MAX_VALUE;
int nextMin2 = Integer.MAX_VALUE;
int nextMinWith1 = minsWith[i];
int nextMinWith2 = minsWith[p];
for(int q=0;q<H;q++){
if(W[q][i]<nextMin1 && W[q][i]>=mins[i] && q!=minsWith[i] && !vector.contains(q)){
nextMin1 = W[q][i];
nextMinWith1 = q;
}
}
for(int q=0;q<H;q++){
if(W[q][p]<nextMin2 && W[q][p]>=mins[p] && q!=minsWith[p] && !vector.contains(q)){
nextMin2 = W[q][p];
nextMinWith2 = q;
}
}
if(nextMin1<=nextMin2){
if (nextMin1==mins[i]) {
vector.addElement(minsWith[p]);
} else {
vector.removeAllElements();
}
mins[i] = nextMin1;
minsWith[i] = nextMinWith1;
//conflict checking
for(int s=0;s<A;s++){
if(minsWith[i]==minsWith[s]&&s!=i&&mins[i]!=Integer.MAX_VALUE){
correctingConflict(W, mins, minsWith, i, s, vector);
return;
}
}
}
else if(nextMin2<nextMin1){
if (nextMin2==mins[p]) {
vector.removeAllElements();
vector.addElement(minsWith[p]);
} else {
vector.removeAllElements();
}
mins[p] = nextMin2;
minsWith[p] = nextMinWith2;
//conflict checking
for(int s=0;s<A;s++){
if(minsWith[p]==minsWith[s]&&s!=p&&mins[p]!=Integer.MAX_VALUE){
correctingConflict(W, mins, minsWith, p, s, vector);
return;
}
}
}
}
}
你能在這裏包含程序代碼嗎？ – 2010-07-03 08:02:08
是的，我會 – Kamran 2010-07-03 08:21:05