백준 18786 Triangles (USACO February 2020 Bronze 1번)

문제 링크: https://www.acmicpc.net/problem/18786

18786번: Triangles (Bronze)

#include <bits/stdc++.h>
using namespace std;
 
struct coord {
    int x, y;
};
int n;
coord p[101];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> p[i].x >> p[i].y;
 
    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            for(int k = 0; k < n; k++) {
                if(i == j || i == k || j == k) continue;
                if(p[i].x == p[j].x && p[i].y == p[k].y)
                    ans = max(ans, abs(p[i].y - p[j].y) * abs(p[i].x - p[k].x));
            }
        }
    }
 
    cout << ans << '\n';
    return 0;
}