Codeforces Round #431 (Div. 2) 849B Tell Your World(暴力+枚举)

这题一开始有点混乱,想着dfs什么的,有点傻.
枚举一号点的各种情况,假设他和之后的某一个点相连,得出该情况下第一条平行线能过几个点,然后根据平行,判断第一个没被第一条平行线过的点,如果这个时候,过的点总和是n,那么就可以了,复杂度是n^2.
最后加个特判,就是只有第一个点单一条线的情况.
我死在特判的if中,

if(sg&&(!(((double)a[2]-a[1])==gd))) can = true;

这个地方少加了个括号,!直接作用在a2-a1上,呵呵.

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <cmath>
#include <stack>
#include <iomanip>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
typedef pair<double,double > pdd;
typedef pair<double,int > pdi;
const int MAXN = 1e3+17;
const int MAXM = 20;
const int MAXV = 2*1e3+17;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
int a[MAXN],vis[MAXN];
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int n;
    cin>>n;
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d",a+i);
    }
    bool can = false;
    for (int i = 2; i <= n ; ++i)
    {
        memset(vis, 0, sizeof(vis));
        int temp = 1;
        double gd = ((double)a[i]-a[1])/(i-1);
        for (int j = i; j <= n ; ++j)
        {
            if(((double)a[j]-a[1])/(j-1)==gd)
            {
                vis[j] = true;
                temp++;
            }
        }
        int p = 2;
        while(vis[p]) p++;
        int x = 1;
        for (int j = p+1; j <= n; ++j)
        {
            if(!vis[j])
            {
                if(((double)a[j]-a[p])/(j-p)==gd)
                {
                    x++;
                }
            }
        }
        if(temp+x>n)
        {
            break;
        }
        if(x&&temp&&x+temp==n)
        {
            can = true;
            break;
        }
    }
    bool sg = true;
    double gd;
    if(n>=3) gd = (double)a[3] - a[2];
    for (int i = 3; i <=n ; ++i)
    {
        if(((double)a[i]-a[2])/(i-2)!=gd)
        {
            sg = false;
        }
    }
    if(sg&&(!(((double)a[2]-a[1])==gd))) can = true;
    if(can) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}