F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Neko and quadrilateral

Time Limit: 10000/7000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 853    Accepted Submission(s): 167


Problem Description
Neko have k points on a 2-dimensional plane. And no three points are in a straight line.
Now, Neko want to you to select four different points to form a quadrilateral. Neko want to know the max area and the min area fo this quadrilateral.
 

Input
The first line contains one integers $n(1 \leq n \leq 2000)$
The next $n$ line, each line contains two integers $x, y(-10^{9} \leq x,y \leq 10^{9})$, means the coordinate of the $i-th$ point.
 

Output
Output the min area and the max area in one line. For convenience, please output twice the area.
 

Sample Input
6 1 1 2 2 1 3 4 1 0 -2 3 5
 

Sample Output
3 27
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 18:23:35, Gzip enabled