南昌不翻车 Codeforces Round #577 (Div. 2)

 D. Treasure Hunting

https://codeforces.com/contest/1201/problem/D

题目大意：  一个n*m的地图，里头有k个宝藏。小人只能自由的左右走，往上走必须在指定列上，不能往下走，问拿到所有宝藏的最小步数。

题目思路：考虑到每层最后拿的宝藏一定在最左边或者最右边，所以dp【i】【0】表示到第i层并且以最左边为这一层结尾的最小花费，dp【i】【1】表示表示到第i层并且以最左边为这一层结尾的最小花费，转移的话就是从上一行宝藏所在行的最左边和最右边转移。

        转移的话，一定是往左或往右找一个最接近的可行通道，上去，二分找到可行通道。

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const LL MAXN = 2e5+5;
LL n,m,k,q;
vector<int>v[MAXN];
LL b[MAXN],l[MAXN],r[MAXN];
LL dp[MAXN][3];
LL dis(LL x,LL y)
{
    return abs(x-y);
}
int main()
{
    cin>>n>>m>>k>>q;
    LL Max = 0;
    for(LL i=1;i<=k;i++){
        LL x,y;
        cin>>x>>y;
        v[x].push_back(y);
        Max = max(Max,x);
    }
    l[1] = 1;r[1] = 1;
    for(LL i=1;i<=n;i++){
        if(v[i].size() == 0)continue;
        sort(v[i].begin(),v[i].end());
        LL len = v[i].size();
        l[i] = v[i][0]; r[i] = v[i][ len-1 ];
    }
    for(LL i=1;i<=q;i++){
        cin>>b[i];
    }
    sort(b+1,b+1+q);
    memset(dp,0x3f,sizeof(dp));
    if(v[1].size() == 0)dp[1][0] = 0;
    else dp[1][1] = r[1]-1;
    int last = 1;
    for(LL i=2;i<=n;i++){
        if(v[i].size() == 0)continue;
        LL lr = lower_bound(b+1,b+1+q,l[last])-b;
        if(lr<=q){
            dp[i][0] = min(dp[i][0], dp[last][0] + dis(l[last],b[lr]) + dis(b[lr],r[i]) + dis(r[i],l[i]));
            dp[i][1] = min(dp[i][1], dp[last][0] + dis(l[last],b[lr]) + dis(b[lr],l[i]) + dis(r[i],l[i]));
        }
        LL ll = upper_bound(b+1,b+1+q,l[last])-b-1;
        if(ll>=1){
            dp[i][0] = min(dp[i][0], dp[last][0] + dis(l[last],b[ll]) + dis(b[ll],r[i]) + dis(r[i],l[i]));
            dp[i][1] = min(dp[i][1], dp[last][0] + dis(l[last],b[ll]) + dis(b[ll],l[i]) + dis(r[i],l[i]));
        }
        LL rr = lower_bound(b+1,b+1+q,r[last])-b;
        if(rr<=q){
            dp[i][0] = min(dp[i][0], dp[last][1] + dis(r[last],b[rr]) + dis(b[rr],r[i]) + dis(r[i],l[i]));
            dp[i][1] = min(dp[i][1], dp[last][1] + dis(r[last],b[rr]) + dis(b[rr],l[i]) + dis(r[i],l[i]));
        }
        LL rl = upper_bound(b+1,b+1+q,r[last])-b-1;
        if(rl>=1){
            dp[i][0] = min(dp[i][0], dp[last][1] + dis(r[last],b[rl]) + dis(b[rl],r[i]) + dis(r[i],l[i]));
            dp[i][1] = min(dp[i][1], dp[last][1] + dis(r[last],b[rl]) + dis(b[rl],l[i]) + dis(r[i],l[i]));
        }
        last = i;
    }
    cout<<min(dp[Max][0],dp[Max][1])+(Max-1)<<endl;
}

C:C. Maximum Median

http://codeforces.com/contest/1201/problem/C

题目大意： 

        一个数组，操作k次，每次找一个数字+1，最后中位数最大是多少。

题目思路：

        一个一个往上加，从中位数开始。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MAXN = 2e5+5;
ll a[MAXN];
ll sum[MAXN];
int main()
{
    ll n,k;
    cin>>n>>k;
    for(ll i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    if(n==1){
        cout<<a[1]+k<<endl;
    }
    else{
        ll ans ;
        ll st = ceil(1.0*n/2);
        ans = a[st];
        for(ll i=st+1;i<=n;i++){
            ll dis = a[i]-a[i-1];
            if((i-st)*dis <= k){
                k -= (i-st)*dis;
                ans = a[i];
            }
            else {
                ans = a[i-1]+(k)/(i-st);k=0;
                break;
            }
        }
        if(k){
            ans += k/(st);
        }
        cout<<ans<<endl;
    }
}