首页 > 专题系列 > Java解POJ > POJ 2640 Playground [解题报告] Java
2013
11-11

POJ 2640 Playground [解题报告] Java

Playground

问题描述 :

George has K <= 20 steel wires shaped in the form of half-circles, with radii a1, a2, . . . , aK. They can be soldered (connected) at the ends, in any angle. Is it possible for George to make a closed shape out of these wires? He does not have to use all the wires.

The wires can be combined at any angle, but may not intersect. Beware of floating point errors.

输入:

Each data set consists of a number 0 < K <= 20 on a line by itself, followed by a line of K space-separated numbers ai. Each number is in the range 0 < ai < 107, and has at most 3 digits after the decimal point.

The input will be terminated by a zero on a line by itself.

输出:

For each test case, there should be one word on a line by itself; “YES” if it is possible to make a simple connected figure out of the given arcs, and “NO” if it isn’t.

样例输入:

1
4.000
2
1.000 1.000
3
1.455 2.958 4.424
7
1.230 2.577 3.411 2.968 5.301 4.398 6.777
0

样例输出:

NO
YES
NO
YES

解题代码:

/* @author: */
import java.util.Scanner;
import java.util.Arrays;
public class Main{

 public static void main(String args[]){
  Scanner sc=new Scanner(System.in);  
  double x[]=new double[21],sum;
  int n,flag;
  int i,j;
  while(sc.hasNext())
    {
      n=sc.nextInt();
      if(n==0) break;
        for(i=0;i< n;i++)
         x[i]=sc.nextDouble();
        Arrays.sort(x,0,n);
        sum=0;flag=0;
        for(i=0;i< n-1;i++)
        {
            sum+=x[i];
            for(j=i+1;j< n;j++)
            if(x[j]<=sum)
            {
                flag=1; 
               break ;
            }
        }        
    	
    	if(flag!=0) System.out.printf("YES\n");
    	else System.out.printf("NO\n");
    }    
   }
}