Codeforces Round #703 (Div. 2) C2. Guessing the Greatest (hard version)交互题

C2. Guessing the Greatest (hard version)交互题

题目链接

题目大意：

有一个由n个不同的数组成的数组，你每次可以询问数组下标区间[l, r]的次大值，会返回给你一个次大值的下标，你需要进行不超过20次询问来得到最大值的下标

解法：

我们可以首先询问区间[1, n]得到整个区间的次大值，假设次大值的下标为k, 并且假设最大值在次大值的右侧，记最大值的下标为ans, 那么对于$i\in \left[k+1,n\right]$, 有$i\in \left[k+1,ans-1\right]$时的返回值不为k，$i\in \left[ans,n\right]$时的返回值为k，这样我们就可以通过二分来找到ans了。（对于最大值在k的左侧同理）
如何判断最大值在次大值的左侧还是右侧呢？我们可以询问 ? 1 k，如果返回值为k那么最大值在左侧，否则在右侧
需要注意的是，我们不能询问 ? x x，这是非法的
log(2e5) = 13复杂度是够的

#include <bits/stdc++.h>
#define ll long long
#define qc ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define pb push_back
using namespace std;
const int MAXN = 2e5 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
int n;
void solve(){
    cin >> n;
    cout << "? 1 " << n << endl;
    cout << endl;
    int flag = 0;
    int k;
    cin >> k;
    // 特判两个端点的情况
    if(k == 1){
    	int l = 2, r = n;
    	while(l < r){
    		int mid = (l + r) >> 1;
    		cout << "? 1 " << mid  << endl;
    		cout << endl;
    		int x;
    		cin >> x;
    		if(x == k)
    			r = mid;
    		else
    			l = mid + 1;
    	}
    	cout << "! " << l << endl;
    }
    else if(k == n){
    	int l = 1, r = n-1;
    	while(l < r){
    		int mid = (l + r + 1) >> 1;
    		cout << "? " << mid << " " << n << endl;
    		cout << endl;
    		int x;
    		cin >> x;
    		if(x == k)
    			l = mid;
    		else
    			r = mid - 1;
    	}
    	cout << "! " << l << endl;
    }
    else{
    	cout << "? 1 " << k << endl;
    	cout << endl;
    	int p;
    	cin >> p;
    	if(p == k){ // 最大值在次大值的左侧
    		int l = 1, r = k-1;
	    	while(l < r){
	    		int mid = (l + r + 1) >> 1;
	    		cout << "? " << mid << " " << k << endl;
	    		cout << endl;
	    		int x;
	    		cin >> x;
	    		if(x == k)
	    			l = mid;
	    		else
	    			r = mid-1;
	    	}
	    	cout << "! " << l << endl;
    	}
    	else{	// 最大值在次大值的右侧
    		int l = k + 1, r = n;
	    	while(l < r){
	    		int mid = (l + r) >> 1;
	    		cout << "? " << k << " " << mid  << endl;
	    		cout << endl;
	    		int x;
	    		cin >> x;
	    		if(x == k)
	    			r = mid;
	    		else
	    			l = mid + 1;
	    	}
	    	cout << "! " << l << endl;
    	}
    }
}

int main()
{
	#ifdef ONLINE_JUDGE
    #else
       freopen("in.txt", "r", stdin);
       freopen("out.txt", "w", stdout);
    #endif

	qc;
    int T;
    // cin >> T;
    T = 1;
    while(T--){

        solve();
    }
	return 0;
}