Submission #345486

---

Source Code Expand

#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>

#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;

using namespace std;

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

	int mx = 0, mi = 2;
	FOR (i, 2, n + 1)
	{
		int d;
		cout << "? " << 1 << " " << i << endl;
		cin >> d;
		if (d <= mx)
			continue;
		mx = d;
		mi = i;
	}
	FOR (i, 2, n + 1)
	{
		if (i == mi)
			continue;
		int d;
		cout << "? " << mi << " " << i << endl;
		cin >> d;
		if (d <= mx)
			continue;
		mx = d;
	}

	cout << "! " << mx << endl;

	return 0;
}

Submission Info

Judge Result