hdu 5504 GT and sequence (水题）

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 int main()
 6 {
 7     long long a[100];
 8     long long t,n,i,cut;
 9     scanf("%I64d",&t);
10     while (t--)
11     {
12         scanf("%I64d",&n);
13         for (i=0;i<n;i++) scanf("%I64d",&a[i]);
14         sort(a,a+n);
15         if (a[0]==0&&a[n-1]==0)
16         {
17             printf("0\n");
18             continue;
19         }
20         if (n==1)
21         {
22             printf("%I64d\n",a[0]);
23             continue;
24         }
25         if (a[0]<0&&a[1]==0&&a[n-1]==0)
26         {
27             printf("0\n");
28             continue;
29         }
30         long long ans=1;
31         for (i=0;i<n;i++)
32         {
33             if (a[i]==0) continue;
34             if (a[i]<0&&i%2==1) ans*=a[i];
35             if (a[i]<0&&i!=n-1&&i%2==0&&a[i+1]<0) ans*=a[i];
36             if (a[i]>0) ans*=a[i];
37         }
38         printf("%I64d\n",ans);
39     }
40 }