解题思路:题目给出的s、r我们可以看成坐标,所以 p( v, u) = sqrt(( s v − s u) 2 + ( r v − r u) 2)表示v、u之间的距离。将 p( v, u) ≥ p( v, u, w) 整理得
p(v, u) >= p(v, w) + p(u, w).而u、v、w三点可以构成三角形,根据三角形两边之和大于第三边,上式不成立。故u、v、w三点在一条直线上,即 p(v, u) = p(v, w) + p(u, w)。答案就出来了,找出两个端点,判断所以的点是否在一条直线上。
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 200000 + 10;
typedef long long ll;
struct tt{
ll s;
ll r;
int id;
bool operator <(tt p1)const{
return s < p1.s || s == p1.s && r < p1.r;
}
}a[maxn];
bool judge(tt p1, tt p2, tt p3){
ll x1 = p1.r - p2.r, y1 = p1.s - p2.s;
ll x2 = p1.r - p3.r, y2 = p1.s - p3.s;
if(x1 * y2 - x2 * y1 == 0) return true;
return false;
}
int main(){
int n;
while(scanf("%d", &n) == 1){
for(int i = 0; i < n; i++){
scanf("%I64d%I64d", &a[i].s, &a[i].r);
a[i].id = i + 1;
}
sort(a, a + n);
tt p1 = a[0], p2 = a[n - 1];
int flag = 1;
for(int i = 1; i < n - 1; i++)
if(!judge(p1, p2, a[i])){flag = 0; break;}
if(flag) printf("1\n%d %d\n", p1.id, p2.id);
else printf("0\n");
}
}