题库练习 Tell Your World
← 上一题 下一题 →

A11080 | Tell Your World

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Connect the countless points with lines, till we reach the faraway yonder.

There are $n$ points on a coordinate plane, the $i$ -th of which being $(i,y_{i})$ .

Determine whether it's possible to draw two parallel and non-overlapping lines, such that every point in the set lies on exactly one of them, and each of them passes through at least one point in the set.

输入格式

The first line of input contains a positive integer $n$ ( $3<=n<=1000$ ) — the number of points.

The second line contains $n$ space-separated integers $y_{1},y_{2},...,y_{n}$ ( $-10^{9}<=y_{i}<=10^{9}$ ) — the vertical coordinates of each point.

输出格式

Output "Yes" (without quotes) if it's possible to fulfill the requirements, and "No" otherwise.

You can print each letter in any case (upper or lower).

输入输出样例

输入 #1
5
7 5 8 6 9
输出 #1
Yes
输入 #2
5
-1 -2 0 0 -5
输出 #2
No
输入 #3
5
5 4 3 2 1
输出 #3
No
输入 #4
5
1000000000 0 0 0 0
输出 #4
Yes
C++ 编辑器
输入
输出