<p>Given an array of points on the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>, return <em>the area of the largest triangle that can be formed by any three different points</em>. Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png" style="height: 369px; width: 450px;" />
<pre>
<strong>Input:</strong> points = [[0,0],[0,1],[1,0],[0,2],[2,0]]
<strong>Output:</strong> 2.00000
<strong>Explanation:</strong> The five points are shown in the above figure. The red triangle is the largest.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> points = [[1,0],[0,0],[0,1]]
<strong>Output:</strong> 0.50000
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>3 &lt;= points.length &lt;= 50</code></li>
	<li><code>-50 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 50</code></li>
	<li>All the given points are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    double largestTriangleArea(vector<vector<int>>& points) {
        
        double largestArea =0;
        
        for (int i = 0; i < points.size(); i++)  
    { 
        vector<int> p1 = points[i];
        
        for (int j = i+1; j < points.size(); j++)  
    { 
        if(i == j) continue;
        
        vector<int> p2 = points[j];
        
         for (int k = j+1; k < points.size(); k++)  
    { 
        if(i == k || j == k) continue;
        
        vector<int> p3 = points[k];
        
        double areaoftriangle = 0.5 * abs(p1[0] * (p2[1] - p3[1]) + p2[0] * (p3[1] - p1[1]) + p3[0] * (p1[1] - p2[1]));
        
             if(areaoftriangle > largestArea){
            largestArea = areaoftriangle;
         }
             
         
    } 
        
    } 
    
    } 
        return largestArea;
        
    }
};
18500