zoj 1101 Gamblers

这道题大意有n个unique的整数，找出其中最大等于另外三个整数之和的数。

s = a + b + c, 最大的s。

 

刚开始因为没有考虑好负数和排除要比较值的情况，一直WA。最后AC的代码如下：

开始的时候做循环拿x做上限，一直WA（因为可能存在负数，所以要到n）；另外就是每个循环里要跳过x。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> g;
int n;

int check(int x)
{
        int i, j, k, t1, t2;

        for(i=0;i<n;i++) {
                if (i==x) continue;
                for(j=i+1;j<n;j++) {
                        if (j == x) continue;
                        t1 = g[i] + g[j];
                        for(k=j+1;k<n;k++) {
                                if (k == x) continue;
                                t2 = t1 + g[k];
                                if (t2 == g[x])
                                        return 1;
                        }
                }
        }
        return 0;
}

int main()
{
        int i, t;
        while(cin>>n && n) {
                g.clear();
                for(i=0;i<n;i++) {
                        cin>>t;
                        g.push_back(t);
                }
                if (n < 4) {
                        cout<<"no solution"<<endl;
                        continue;
                }
                sort(g.begin(), g.end());
                for(i=n-1;i>=0;i--) {
                        if (check(i)) {
                                cout<<g[i]<<endl;
                                break;
                        }
                }
                if(i == -1) {
                        cout<<"no solution" << endl;
                }
        }
        return 0;
}