CodeForces - 849B Tell Your World 简单判两条平行线

已经规定找两条平行直线

通过前三个点可以判定一定有两个点再同一条直线上

也就是下面代码中 solve 函数里面的 三部分，其余的就是判断斜率是否相同了

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 1000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int n, a[maxn];

struct node {
    int pos, v;
    node() {}
    node(int p, int v) : pos(p), v(v) {}
};
vector<node> b;

void solve() {
    int f = 0;
    // ----  1 and 2
    int t = a[2] - a[1];
    for(int i = 3; i <= n; ++i) {
        if(a[i]-a[1] != t*(i-1)) {
            b.push_back(node(i,a[i]) );
        }
    }
    if(b.size() == 0) { puts("No"); return; }
    for(int i = 1; i < b.size(); ++i)
        if( (b[i].v-b[i-1].v) != t*(b[i].pos-b[i-1].pos) ) { f = 1; break;}
    if(f == 0) { puts("Yes"); return; }

    // ------ 1 and 3
    b.clear(), f = 0;
    t = a[3] - a[1];
    if( (a[2]-a[1])*2 != t)  b.push_back( node(2, a[2]) );
    for(int i = 4; i <= n; ++i) {
        if((a[i]-a[1])*2 != t*(i-1)) {
            b.push_back( node(i, a[i]) );
        }
    }
    if(b.size() == 0) { puts("No"); return; }
    for(int i = 1; i < b.size(); ++i)
        if( (b[i].v-b[i-1].v)*2 != t*(b[i].pos-b[i-1].pos) ) { f = 1; break;}
    if(f == 0) { puts("Yes"); return; }

    // ----------  2 ans 3
    b.clear(), f = 0;
    t = a[3] - a[2];
    if(a[2]-a[1] != t) b.push_back( node(1, a[1]) );
    for(int i =4; i <= n; ++i) {
        if(a[i]-a[2] != t*(i-2)) {
            b.push_back( node(i,a[i]) );
        }
    }
    if(b.size() == 0) { puts("No"); return; }
    for(int i = 1; i < b.size(); ++i)
        if( (b[i].v-b[i-1].v) != t*(b[i].pos-b[i-1].pos) ) { f = 1; break;}
    if(f == 0) { puts("Yes"); return; }
    puts("No");
}

int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
    solve();
    return 0;
}