24 lines
546 B
Java
24 lines
546 B
Java
|
package LanQiaoOJ;
|
|||
|
|
|
|||
|
|
import java.util.Arrays;
|
|||
|
|
import java.util.Scanner;
|
|||
|
|
|
|||
|
|
public class Ѱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˻<EFBFBD>2 {
|
|||
|
|
static int N=1010;
|
|||
|
|
static int []a=new int [N];
|
|||
|
|
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
Scanner sc=new Scanner(System.in);
|
|||
|
|
int n=sc.nextInt();
|
|||
|
|
for(int i=0;i<n;i++) {
|
|||
|
|
a[i]=sc.nextInt();
|
|||
|
|
|
|||
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̰<EFBFBD><CCB0><EFBFBD>㷨<EFBFBD><E3B7A8><EFBFBD><EFBFBD>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
Arrays.sort(a,0,n);//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>㷨<EFBFBD><E3B7A8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD>临<EFBFBD>Ӷȣ<D3B6>nlogn
|
|||
|
|
int ans=a[n-1]*a[n-2]*a[n-3];
|
|||
|
|
ans=Math.max(ans, a[0]*a[1]*a[n-1]);
|
|||
|
|
System.out.print(ans);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|