package lab06_classandobject;
import java.util.Scanner;
public class ArrayOfPoints {
	private Point[] a=new Point[10];
	private int n;

	public void input(){
		System.out.println("Enter n");
		Scanner kb=new Scanner(System.in);
		n=kb.nextInt();
		for (int i=0;i<n;i++)
		{
			System.out.println("Enter Point " + i + ":");
			Point o=new Point();
			o.input();
			//o.output();
			a[i] = o;
		}
	}

	public void output(){
		System.out.println("Your Array:");
		for (int i=0;i<n;i++)
			a[i].output();
		System.out.println();
	}

	public double LargestDistance(){
		double max=0;
		Point m=null;
		Point p=null;
		for (int j=0;j<n;j++)
		{
			for (int k=0;k<n;k++)
			{
				if (a[j].distance(a[k]) > max)
					max=a[j].distance(a[k]);
			}
		}
		return max;
	}

	public double Circumference(int x,int y,int z){
		double q=a[x].distance(a[y]);
		double w=a[x].distance(a[z]);
		double e=a[y].distance(a[z]);
		return ((q+w+e)/2);
	}

	public double LargestArea(){
		double max=0;
		
		for (int j=0;j<n-2;j++)
		{
			for (int d=j+1;j<n-1;j++)
			{
				for (int k=d+1;j<n;j++)
				{
					if (a[j].area(a[d], a[k]) > max)
						max=a[j].area(a[d], a[k]);
				}
			}
		}

	return max;
	}
	public double LargestCircumference(){
		double max=0;
		
		for (int j=0;j<n-2;j++)
		{
			for (int d=j+1;j<n-1;j++)
			{
				for (int k=d+1;j<n;j++)
				{
					if (Circumference(j, d, k) > max)
						max=Circumference(j, d, k) ;
				}
			}
		}

	return max;
	}

	public static void main(String[] args) {
		ArrayOfPoints arr=new ArrayOfPoints();
		arr.input();
		arr.output();
		System.out.println("largest distance: "+arr.LargestDistance());
		System.out.println("largest area "+arr.LargestArea());
		System.out.println("largest Circumference "+arr.LargestCircumference());
		
	}

}