Codeforces--872B--Maximum of Maximums of Minimums

题目描述：
You are given an array a1, a2, …, an consisting of n integers, and an integer k. You have to split the array into exactly k non-empty subsegments. You’ll then compute the minimum integer on each subsegment, and take the maximum integer over the k obtained minimums. What is the maximum possible integer you can get?

Definitions of subsegment and array splitting are given in notes.
输入描述:
The first line contains two integers n and k (1 ≤ k ≤ n ≤  105) — the size of the array a and the number of subsegments you have to split the array to.

The second line contains n integers a1,  a2,  …,  an ( - 109  ≤  ai ≤  109).
输出描述:
Print single integer — the maximum possible integer you can get if you split the array into k non-empty subsegments and take maximum of minimums on the subsegments.
输入：
5 2
1 2 3 4 5
5 1
-4 -5 -3 -2 -1
输出：
5
-5
题意：
给出一个有n个整数的数组 a1, a2, …, an 和一个整数k。你被要求把这个数组分成k 个非空的子段。 然后从每个k 个子段拿出最小值，再从这些最小值中拿出最大值。求这个最大值最大能为多少？
题解：
分类讨论一下k就好了.
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 100000 + 5;
const int INF = 1000000000;
int a[maxn];

int main(){
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF){
        int minn = INF;
        int maxx = -INF;
        for(int i = 0; i < n; i ++){
            scanf("%d",&a[i]);
            maxx = max(maxx,a[i]);
            minn = min(minn,a[i]);
        }
        if(k == 1) printf("%d\n",minn);
        else if(k == 2) printf("%d\n",max(a[0],a[n - 1]));
        else printf("%d\n",maxx);
    }
    return 0;
}