Submission #345263

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;

    int a;
    int maxDist = -1;
    for(int i=1; i<n; ++i){
        cout << "? 0 " << i << endl;
        int dist;
        cin >> dist;
        if(dist > maxDist){
            a = i;
            maxDist = dist;
        }
    }

    maxDist = -1;
    for(int i=0; i<n; ++i){
        if(i == a)
            continue;
        cout << "? " << a << ' ' << i << endl;
        int dist;
        cin >> dist;
        maxDist = max(maxDist, dist);
    }
    cout << "! " << maxDist << endl;

    return 0;
}

Submission Info

Judge Result