POJ1944--Fiber Communications

题目来源：http://poj.org/problem?id=1944
题目内容：
Fiber Communications
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 4728 Accepted: 1412
Description

Farmer John wants to connect his N (1 <= N <= 1,000) barns (numbered 1..N) with a new fiber-optic network. However, the barns are located in a circle around the edge of a large pond, so he can only connect pairs of adjacent barns. The circular configuration means that barn N is adjacent to barn 1.

FJ doesn’t need to connect all the barns, though, since only certain pairs of cows wish to communicate with each other. He wants to construct as few
connections as possible while still enabling all of these pairs to communicate through the network. Given the list of barns that wish to communicate with each other, determine the minimum number of lines that must be laid. To communicate fr