1220: AC100天

Time Limit: 1 Sec  Memory Limit:
128 MB

Submit: 89  Solved: 12

[

id=1220">Submit][Status][

pid=1220">Web
Board]

Description

Input

Output

Sample Input

5 1

34 77 82 83 84

5 2

10 30 55 56 90

Sample Output

76

59

HINT

Source

解析：水题一道，细致考虑清楚每种特殊情况就可以。

AC代码：

#include <bits/stdc++.h>

using namespace std;

int a[102];

int main(){

    #ifdef sxk

        freopen("in.txt", "r", stdin);

    #endif //sxk

    int n, m;

    while(~scanf("%d%d", &n, &m)){

        for(int i=1; i<=n; i++) scanf("%d", &a[i]);

        if(m >= n){ printf("%d\n", 100); continue; }

        int ans = 0;

        a[0] = 0;

        a[n+1] = 101;

        for(int i=1; i<=n+1; i++){

            int foo = a[min(m+i, n+1)] - 1 - a[i-1];

            ans = max(ans, foo);

        }

        printf("%d\n", ans);

    }

    return 0;

}