题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e9, maxm = 4e4 + 5;
const int N = 1e6;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// int a[505][5005];
// bool vis[505][505];
// char s[505][505];
int a[maxn], b[maxn];
int vis[maxn];
string s;
int n, m;struct Node{int val, id;bool operator<(const Node &u)const{return val < u.val;}
};
// Node c[maxn];int ans[maxn];
int pre[maxn];//long long ? maxn ?void solve(){int res = 0;int q, k;int sum = 0;int mx = 0;cin >> n;// for(int i = 1; i <= n; i++){//     cin >> a[i];// }int l = 1, r = 2;int x, y;for(int i = 3; i <= n; i++){cout << "? " << l << ' ' << i << '\n';cout.flush();cin >> x;cout << "? " << r << ' ' << i << '\n';cout.flush();cin >> y;if(x < y){l = r;r = i;}else if(x > y){r = i;}}cout << "! " << l << ' ' << r << '\n';cout.flush();cin >> res;
}signed main(){ios::sync_with_stdio(0);cin.tie(0);int T = 1;cin >> T;while (T--){solve();}return 0;
}