HDU 5655 CA Loves Stick

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=5655

思路：A quadrilateral cannot be formed as long as one side is greater than the sum of the other three sides,Sort it first,然后做减法,It is possible to do additionlong long

AC代码：

登录后复制

      
      

       
       #include <iostream>
       
       

       
       #include <cstdio>
       
       

       
       #include <cstdlib>
       
       

       
       #include <algorithm>
       
       

       
       #include <queue>
       
       

       
       #include <stack>
       
       

       
       #include <map>
       
       

       
       #include <cstring>
       
       

       
       #include <climits>
       
       

       
       #include <cmath>
       
       

       
       #include <cctype>
       
       

       
       const 
       
       int 
       
       inf 
       
       = 
       
       0x3f3f3f3f;
       
       //1061109567
       
       

       
       typedef 
       
       long 
       
       long 
       
       LL;
       
       

       
       #define lson l,m,rt<<1
       
       

       
       #define rson m+1,r,rt<<1|1
       
       

       
       using 
       
       namespace 
       
       std;
       
       

       
       LL 
       
       a[
       
       4];
       
       

       
       int 
       
       main()
       
       
{
       
       
    
       
       int 
       
       t;
       
       
    
       
       scanf(
       
       "%d",
       
       &
       
       t);
       
       
    
       
       while(
       
       t
       
       --)
       
       
    {
       
       
        
       
       bool 
       
       flag 
       
       = 
       
       false;
       
       
        
       
       for(
       
       int 
       
       i
       
       =
       
       0; 
       
       i
       
       <
       
       4; 
       
       i
       
       ++)
       
       
        {
       
       
            
       
       scanf(
       
       "%I64d",
       
       &
       
       a[
       
       i]);
       
       
            
       
       if(
       
       a[
       
       i] 
       
       == 
       
       0)
       
       
                
       
       flag 
       
       = 
       
       true;
       
       
        }
       
       
        
       
       if(
       
       flag)
       
       
        {
       
       
            
       
       printf(
       
       "No\n");
       
       
            
       
       continue;
       
       
        }
       
       
        
       
       sort(
       
       a,
       
       a
       
       +
       
       4);
       
       
        
       
       LL 
       
       sum 
       
       = 
       
       a[
       
       3];
       
       
        
       
       int 
       
       i;
       
       
        
       
       for(
       
       i
       
       =
       
       0; 
       
       i
       
       <
       
       3; 
       
       i
       
       ++)
       
       
        {
       
       
            
       
       sum 
       
       -= 
       
       a[
       
       i];
       
       
            
       
       if(
       
       sum 
       
       < 
       
       0)
       
       
                
       
       break;
       
       
        }
       
       
        
       
       if(
       
       i 
       
       != 
       
       3)
       
       
            
       
       printf(
       
       "Yes\n");
       
       
        
       
       else
       
       
            
       
       printf(
       
       "No\n");
       
       
    }
       
       
    
       
       return 
       
       0;
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.
       
       
40.
       
       
41.
       
       
42.
       
       
43.
       
       
44.
       
       
45.
       
       
46.
       
       
47.
       
       
48.
       
       
49.
       
       
50.
       
       
51.