Pagini recente » Cod sursa (job #1340512) | Cod sursa (job #2035104) | Cod sursa (job #1313362) | Cod sursa (job #1097450) | Cod sursa (job #1694665)
#include <bits/stdc++.h>
#define x first
#define y second
#define pii pair < int, int >
#define ld long double
#define maxN 100002
using namespace std;
ifstream f ("rubarba.in");
ofstream g ("rubarba.out");
int i,n;
ld x, y, s, c, mx, Mx, my, My, m, l, r;
pii v[maxN];
ld ok(ld u)
{
int i;
mx = my = 1e9;
Mx = My = -1e9;
for(i = 1; i <= n; ++ i)
{
s = sin(u);
c = cos(u);
x = v[i].x * c - v[i].y * s;
y = v[i].x * s + v[i].y * c;
mx = min(mx, x);
Mx = max(Mx, x);
my = min(my, y);
My = max(My, y);
}
return (Mx - mx) * (My - my);
}
void read()
{
f >> n;
for(i = 1; i <= n; ++ i)
f >> v[i].x >> v[i].y;
}
void solve()
{
l = 0;
r = 2 * atan(1);
for(i = 1; r - l > 1e-17; ++ i)
{
m = (l + r) / 2.0;
if (ok(m + 1e-17) < ok(m))
l = m;
else r = m;
}
}
void write()
{
g << fixed << setprecision(2) << ok(l);
}
int main()
{
read();
solve();
write();
return 0;
}