USACO 2019 January Contest Silver Problem 3 Mountain View
From her pasture on the farm, Bessie the cow has a wonderful view of a mountain range on the horizon. There are?NN?mountains in the range (1≤N≤1051≤N≤105). If we think of Bessie's field of vision?as?the?xyxy?plane, then each mountain is a triangle whose base rests on the?xx?axis. The two sides of the mountain are both at 45 degrees to the base, so the peak of the mountain forms a right angle. Mountain?ii?is therefore precisely described by the location?(xi,yi)(xi,yi)?of its peak. No two mountains have exactly the same peak location.
Bessie is trying to count all of the mountains, but since they all have roughly the same color, she cannot see a mountain if its peak lies on or within the triangular shape of any other mountain.
Please determine the number of distinct peaks, and therefore mountains, that Bessie can see.
INPUT FORMAT (file mountains.in):
The first line of input contains?NN. Each of the remaining?NN?lines contains?xixi?(0≤xi≤1090≤xi≤109) and?yiyi?(1≤yi≤1091≤yi≤109) describing the location of one mountain's peak.
OUTPUT FORMAT (file mountains.out):
Please print the number of mountains that Bessie can distinguish.
SAMPLE INPUT:
3 4 6 7 2 2 5
SAMPLE OUTPUT:
2
In this example, Bessie can see the first and last mountain. The second mountain is obscured by the first.
Problem credits: Brian Dean
以上就是關于【USACO 2019 January Contest Silver Problem 3 Mountain View】的解答，如需了解學校/賽事/課程動態，可至翰林教育官網獲取更多信息。
往期文章閱讀推薦：
NOAI人工智能奧賽 2026-2027 活動章程出爐：新規則必看！
NOAI、UKOAI、USAAIO三大AI奧賽新賽季全面啟動：留學申請的“核武器”來了！
翰林AMC8視頻課重磅上線！
國際競賽真題資源免費領取
