hihocoder 1051 补提交卡

   [原题目点此http://hihocoder.com/problemset/problem/1051](http://hihocoder.com/problemset/problem/1051)

#include "iostream"
#include "algorithm"
#include "string"
#include "cstdio"
using namespace std;



int main(){
    int t,m,n;
    int a[105],b[105];//a保存未提交的日期，b保存每两次未提交之间已提交的天数
    cin >> t;
    while(t--) {
        cin >> n >> m;

         a[0] = 0;
         for(int i = 1; i <= n; i++) {
            cin >> a[i];
            b[i] = a[i] - a[i-1];
         }

         b[n+1] = 100 - a[n];//b中数据比a多一个
        int best;
        if(n <= m) best = 100; //若卡比未提交次数多，则能补齐   100天
        else {
              best = -1;
             for(int i = 1; i <= n - m +1; i++) {
                int sum = b[i];
                for(int j = i; j < i + m;j++) sum += b[j+1];//若补齐第i天，则连续天数变为b[i]+b[i+1]，若补齐第i，i+1天，则连续天数变为b[i]+b[i+1]+b[i+2],以此类推

                if(sum > best) best = sum;//更新best
            }
            best--;
        }

        cout << best << endl;
    }

    return 0;
}