Codeforces #616 Div2 C Mind Control

Codeforces #616 Div2 C Mind Control

http://codeforces.com/contest/1291/problem/C

题意： 给出n个数据，有n个人，从1到n编号排列，现在主人公的编号为m，每个人可以选择删去第一个或最后一个数据，主人公可以控制k个人的选择

做法： 暴力枚举k个人当中有i个人选择删去第一个数据，剩下的m-k-1个人当中有j个人选择删去第一个数据。

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
int a[maxn],t,n,m,k;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        rep(i,1,n)scanf("%d",&a[i]);
        if (k<m-1)
        {
            int ans=0;
            rep(i,0,k)
            {
                int minn=INF;
                rep(j,0,m-k-1)minn=min(minn,max(a[i+j+1],a[n-m+i+j+1]));
                ans=max(ans,minn);
            }
            W(ans);
        }
        else if (k>=m-1)
        {
            int maxx=0;
            for (int i=1;i+n-m<=n;i++)maxx=max(maxx,max(a[i],a[i+n-m]));
            W(maxx);
        }
    }
}