Trees in a plantation.

There are N trees in a plantation. Each tree is assigned an information card which notes the following information: location (x, y), type (coffee or tea). The plantation manager wants to construct a fence around the plantation. For minimum cost, the fence length needs to be as short as possible. The manager also wants to build a watering system based on tubes to let water runs from the pump to each tree. The location of the pump needs to be considered to minimize the total length of the used tubes. Write C program that can help the manager to do the aboveLet the program input and output through file. Structure of file – First line: N (number of trees). – The following N lines, line #i (0 <= i <= N - 1): Xi Yi Li (Xi Yi: location of tree #i, Li : type of tree #i (0-coffee, 1-tea). Structure of file NongTrai.out: - Line #1: S0 S1 (S0: coffee tree count, S1: tea tree count). - Line #2: Cmin (shortest fence length). - Line #3: Dmin (minimum total length of used tubes).

20% OFF on your first order








Let’s Get Started

Team with top experts around the globe to succeed in learning


How it works

If you are looking for the best essay writing services for cheap, then you have come to the right place. specializes in custom academic papers for all levels of students. From high school students to college graduates and undergraduates, all the way up to university students at master’s degree and even doctoral levels.

Place an order

Fill out the order form. Attach any custom instructions.

Make Payment

Pay online safely with major platforms.

Writing Process

We’ll assign your paper to the most suitable writer & editor.

Get your Order

Once complete, we’ll send the paper to your email.