http://codeforces.com/contest/872/problem/B
题意:将一个数组连续的分成k块,每块中取最小值。求这k个最小值中的最大值。
题解:①分成一个的情况:就是最小那个,②分成两个的情况:暴力即可,我用了rmq,没在意负数初始化成-1了。。。③k大于3的情况,把最大的那个数分成独立的一组即可。
代码:
#include<bits/stdc++.h>
#define debug cout<<"aaa"<<endl
#define d(a) cout<<a<<endl
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define LL long long
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define MIN_INT (-2147483647-1)
#define MAX_INT 2147483647
#define MAX_LL 9223372036854775807i64
#define MIN_LL (-9223372036854775807i64-1)
using namespace std;
const int N = 100000 + 5;
const int mod = 1000000000 + 7;
const double eps = 1e-8;
int a[N],minn[N][30],n;
int min_ans;
void init(){
for(int j=1;(1<<j)<=n;++j){
for(int i=1;i+(1<<(j-1))-1<=n;++i){
minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
}
}
}
int rmq(int l,int r){
int k=int(log((double)(r-l+1))/log(2.0));
min_ans=min(minn[l][k],minn[r-(1<<k)+1][k]);
return min_ans;
}
int main(){
int k,ans;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
minn[i][0]=a[i];
}
if(k==2){
init();
ans=MIN_INT;
for(int i=1;i<=n-1;i++){
ans=max(ans,max(rmq(1,i),rmq(i+1,n)));
}
cout<<ans<<endl;
return 0;
}
sort(a+1,a+n+1);
if(k==1){
cout<<a[1]<<endl;
}
else{
cout<<a[n]<<endl;
}
return 0;
}