SGU 299.Triangle

题意:

  给出n(<=1000)条线段的长度ai(<=10^500),输出任意三条能组成三角形的边.没有输出3个0.

Solution:

  简单题.只是要处理高精度.

      java大法好.

import java.util.*;
import java.math.*;
public class Solution {
    public static void main(String[] args){
        Scanner cin=new Scanner(System.in);
        int n=cin.nextInt();
        BigInteger[] a=new BigInteger[1009];
        for(int i=1;i<=n;++i){
            a[i]=cin.nextBigInteger();
        }
        Arrays.sort(a,1,n+1);
        for(int i=1;i<=n;++i){
            for(int j=i+1;j<n;++j){
                if(a[i].add(a[j]).compareTo(a[j+1])==1){
                    System.out.println(a[i]+" " + a[j]+ " "+ a[j+1]);
                    System.exit(0);
                }
            }
        }
        System.out.println("0 0 0");
    }
}
View Code
原文地址:https://www.cnblogs.com/keam37/p/4596650.html