Submission #7995098

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;

signed main(){
    int n;
    cin >> n;
    vector<P> dist_1(n + 1);
    for(int i = 2; i <= n; i++){
        cout << "? " << 1 << " " << i << endl;
        cin >> dist_1[i].first;
        dist_1[i].second = i;
    }
    sort(ALL(dist_1));
    reverse(ALL(dist_1));
    int dist, ans = 0;
    for(int i = 1; i <= n; i++){
        if(i != dist_1[0].second){
            cout << "? " << dist_1[0].second << " " << i << endl;
            cin >> dist;
            ans = max(ans, dist);
        }
    }
    cout << "! " << ans << endl;
    return 0;
}

Submission Info

Judge Result