Submission #345403

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int dist[51];
int main(){
	dist[0] = -1e9;
	int N;
	cin >> N;
	
	for(int i = 1 ; i <= N ; i++){
		cout << "? " << 1 << " " << i << endl;
		cin >> dist[i];
	}
	int p = max_element(dist,dist+N+1) - dist;
	int ans = 0;
	for(int i = 1 ; i <= N ; i++){
		cout << "? " << p << " " << i << endl;
		cin >> dist[i];
		ans = max(ans,dist[i]);
	}
	cout << "! " << ans << endl;
}

Submission Info

Judge Result