Educational Codeforces Round 37 A. Water The Garden

最新推荐文章于 2021-03-03 01:08:43 发布

Joey丶sunk

最新推荐文章于 2021-03-03 01:08:43 发布

阅读量210

点赞数 1

分类专栏： codefoces

本文链接：https://blog.csdn.net/xiang_6/article/details/79255886

版权

codefoces 专栏收录该内容

178 篇文章 1 订阅

订阅专栏

没看懂题意，猜样例写的

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1000 + 7, maxd = 1e5 + 7;
const int mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, k;
int T;

int main() {
    kuaidian;
    cin >> T;
    while(T--) {
        cin >> n >> k;
        int ans = 0;
        int a; cin >> a;
        ans = max(ans, a-0);
        int b = a;
        for(int i = 1; i < k; ++i) {
            cin >> a;
            ans = max(ans, (a-b+2)/2 );
            b = a;
        }
        ans = max(ans, n-b+1);
        cout << ans << endl;
    }
    return 0;
}