Submission #346502

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main(){
	map<pair<int,int>,int> pairs;//右の方が小さい
	int n;
	cin>>n;
	int max=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<i;j++){
			int dist;
			cout<<"? "<<i<<" "<<j<<endl;
			cin>>dist;
			if(max<dist)max=dist;
			pairs[pair<int,int>(i,j)]=dist;
		}
	}
	cout<<"! "<<max<<endl;
	return 0;
}

Submission Info

Judge Result