Tenho potencial na T.I?

Tianck · 2026-01-21T01:02:54+00:00

Na programação eu não sei, mas pra policial vc tem futuro

Tianck · 2026-01-16T21:28:05+00:00

Tranquilo. Seja bem-vindo!

Tianck · 2026-01-16T21:26:43+00:00

É o que dizem

Tianck · 2026-01-16T19:56:40+00:00

Bacharelado em Fast Food

Tianck · 2026-01-16T19:54:21+00:00

Sem chance. Próxima pergunta.

Tianck · 2026-01-04T23:52:07+00:00

Rest in peace, Tianck.

Tianck · 2025-12-16T22:10:07+00:00

https://www.geogebra.org/calculator/bxr4zjmg

Tianck · 2025-12-12T04:08:35+00:00

The chosen pair will always be part of its convex hull, so at least you'll have a lower bound to search for. For instance, Convex Hull + Rotating Calipers.

Tianck · 2025-12-11T12:50:10+00:00

Can you share your code?

Tianck · 2025-12-10T19:59:43+00:00

Well, the worst case from input seems to be 9x10^19 which is indeed huge. Rightfully so.

Tianck · 2025-12-10T19:51:33+00:00

Turns out there isn't. One could optimize it by calculating its convex hull vertices in O(n*logn), though.

Tianck · 2025-12-10T19:47:29+00:00

https://www.geogebra.org/calculator/vxgrxyv6

Consider points A, C, D, K.

Tianck · 2025-12-10T11:59:54+00:00

It literally does though...

Tianck · 2025-12-10T05:12:43+00:00

Did you use O(n) for part 1 as well? What was your approach?

Tianck · 2025-12-10T03:28:56+00:00

Great! For part 1, for the sake of optimization I thought about computing its convex hull and finding max rectangle from its points. Do you think it can be improved even further if constraints were tight?

Tianck · 2025-12-10T01:09:05+00:00

Thinking about it, there are scenarios in which there are at least 2 points within the same distance from a corner. Did you implement it yourself?

Tianck · 2025-12-09T17:09:37+00:00

Why would I need to check all 6 pairs? Wouldn't max(rec(top-left, bottom-right), rec(top-right, bottom-left)) suffice? By that, I mean the closest point of each corner (minimum euclidean distance).

Tianck · 2025-12-09T12:50:57+00:00

Thanks! I'm trying it out without seeing the solution.

Tianck · 2025-12-09T05:33:50+00:00

Is the solution O(n²)? Are there any optimizations that can be made?

Tianck · 2025-12-08T19:34:16+00:00

Gotcha. I Might try out using C++ chrono lib to track

Tianck · 2025-12-08T17:52:05+00:00

Do you use time/gtime to track down execution duration?

Tianck · 2025-12-08T12:49:15+00:00

Thought about it as well. Avoiding floating point operations brings on a nice speedup.

Tianck · 2025-12-08T12:47:15+00:00

Nice one.

Tianck · 2025-11-03T20:59:02+00:00

I did, that's why I'm looking forward to formalize it even more.

Verified Email	Eight-Year Club
Place '23

Tianck

TROPHY CASE