2510: Product
Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
---|---|---|---|---|---|
1s | 65536K | 691 | 205 | Standard |
There are multiple test cases, the first line of each test case is a integer n. (2<=n<=20) The next line have n integers (every integer in the range [1,1000]). We can divide these n integers into two parts and get the sum of the integers in these two parts, define them as sumA and sumB. Please calc the max number of sumA*sumB and output it in a single line.
Sample Input
3 5 3 7 2 4 9
Sample Output
56 36
Hint
(5,3),(7) sumA=8 sumB=7 sumA*sumB=56 (5),(3,7) sumA=5 sumB=10 sumA*sumB=50 (3),(5,7) sumA=3 sumB=12 sumA*sumB=36 (),(3,5,7) sumA=0 sumB=15 sumA*sumB=0 The max is 56.
Problem Source: xwbsw
This problem is used for contest: 120
Submit / Problem List / Status / Discuss