i have saw a problem but i forgot its name.

the problem was to find 2 triangles with disjoint segments. ai<=1e9

its solution was :

because fib[45] > 1e9 ,so it is always possible to get a triangle when n>=45,and it's always possible to get 2 triangles when n>=48.

when n<=48, we use brute force to solve the problem.

help me find the problem pls.