#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> PII;
#define pb emplace_back
//#define int ll
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define lc u << 1
#define rc u << 1 | 1
void solve();
const int N = 1e6 + 10;
signed main() {
// IOS;
ll t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
void qq(ll l, ll r)
{
cout << "? " << l << " " << r << endl;
}
void aans(ll l)
{
cout << "! " << l << endl;
}
void solve() {
ll n; cin >> n;
vector<ll> a(n+1);
ll l = 1, r = n;
vector<bool> f(n+1,1);
while(l < r)
{
ll mid = (l + r) >> 1;
qq(l,mid);
ll x, cnt = 0;
for(int i = l; i <= mid; ++ i)
{
cin >> x;
if(x >= l && x <= mid)
cnt ++;
}
if(cnt & 1)
r = mid;
else
l = mid + 1;
}
aans(l);
}
每日错题2024年8月29日
最新推荐文章于 2024-08-29 22:25:44 发布