You are given a convex polygon withnnn vertices andmmmdifferent points strictly outside the polygon which are all legal positions to install illuminants. An illuminant can light up some exterior boundaries of the polygon. Your task is to install the least number of illuminants to light up all exterior boundaries of the polygon and provide a feasible scheme.
You are given a convex polygon with nnn vertices and mmm different points strictly outside the polygon which are all legal positions to install illuminants. An illuminant can light up some exterior boundaries of the polygon. Your task is to install the least number of illuminants to light up all exterior boundaries of the polygon and provide a feasible scheme.
不断挑战自我,才能突破极限!全网最全C++题库,让您在编程道路上越走越远。