2017 Multi-University Training Contest - Team 3

HDU-6058 Kanade's sum(维护附近第k大+链表)

题意：给一个1-n的排列，求所有区间第k大数的和

题解：对每一个数考虑其贡献，那么我们可以往左找第k大，然后往右找第k大，类似与单调栈算贡献的思想。关键是怎么找，可以用链表来优化，记录下每个数字出现的位置，从小数字开始找，算完它的贡献后把它删掉，这样对于每个数字他两边都是比他大的。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

const int maxn = 5*1e5+10;

int pre[maxn], nex[maxn];
int a[maxn], pos[maxn];
int lnum[maxn], rnum[maxn];
int n, k;
long long ans;

void del(int x){
    pre[nex[x]] = pre[x];
    nex[pre[x]] = nex[x];
}

long long Count(int x){
    int l = 0, r = 0;
    for(int i = x; i>=1 && l<=k; i = pre[i]){
        lnum[++l] = i-pre[i];
        //if(x == 5) cout<<" "<<i<<" "<<pre[i]<<endl;
    }
    for(int i = x; i<=n && r<=k; i = nex[i]){
        rnum[++r] = nex[i]-i;
    }
    long long res = 0;
    /*cout<<"x:"<<x<<endl;
    cout<<l<<endl;
    for(int i = 1; i<=l; i++){
        cout<<lnum[i]<<" ";
    }
    cout<<endl<<r<<endl;
    for(int i = 1; i<=r; i++){
        cout<<rnum[i]<<" ";
    }
    cout<<endl;
    cout<<endl;*/

    for(int i = 1; i<=l; i++){
        if(k-i+1<=r && k-i>=0){
            res+=lnum[i]*rnum[k-i+1];
            /*if(x == 2){
                cout<<" "<<i<<" "<<k-i+1<<" "<<lnum[i]<<" "<<lnum[i]*rnum[k-i+1]<<" "<<res<<endl;
            }*/
        }
    }

    return res;

}

int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        ans = 0;
        memset(pre, 0, sizeof(pre));
        memset(nex, 0, sizeof(nex));
        memset(pos, 0, sizeof(pos));
        memset(lnum, 0, sizeof(lnum));
        memset(rnum, 0, sizeof(rnum));
        scanf("%d %d", &n, &k);
        for(int i = 1; i<=n; i++){
            scanf("%d", &a[i]);
            pos[a[i]] = i;
            pre[i] = i-1;
            nex[i] = i+1;
        }
        pre[0] = 0; nex[0] = 1;
        pre[n+1] = n; nex[n+1] = n+1;


        for(int i = 1; i<=n; i++){
            ans += Count(pos[i])*i;
            del(pos[i]);
        }
        cout<<ans<<endl;
    }

    return 0;
}

HDU-6060 RXD and dividing(贪心+边贡献)

题意：给你一棵树，把2-n放进k个集合里，对于每一个集合加入1，然后该集合的值为其生成树值，算所有集合可能的最大值。

题解：首先一条边肯定是经过的越多越好，然后1是可以到达所有点的，然后从1开始dfs，记录每个节点子树数量，那么当前节点u和其父节点的连边的贡献就是min(k, siz[u])*w

因为当siz[u]>k时，该边最多会通到k个集合。当k>siz[u]时，我们把这些节点分散到k个集合中，那么该边通过的次数就会最多

代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int n, k;
int head[1000010];
int siz[1000010];
int cnt;
long long ans;

struct Edge{
    int v, w, next;
}edge[2*1000010];

void init(){
    memset(head, -1, sizeof(head));
    memset(siz, 0, sizeof(siz));
    cnt = 0;
}

void addedge(int u, int v, int w){
    edge[cnt].v = v;
    edge[cnt].w = w;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}

void dfs(int x, int fa, int len){
    siz[x] = 1;
    for(int i = head[x]; i!=-1; i = edge[i].next){
        int v = edge[i].v;
        int w = edge[i].w;

        if(v!=fa){
            dfs(v, x, w);
            siz[x]+=siz[v];
        }
    }
    if(x!=1){
        ans += (long long)len*min(k, siz[x]);
    }
}

int main(){
    while(scanf("%d %d", &n, &k)!=EOF){
        ans = 0;
        init();

        for(int i = 1; i<=n-1; i++){
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            addedge(u, v, w);
            addedge(v, u, w);
        }

        cnt = 0;
        dfs(1, 0, 0);
        cout<<ans<<endl;
    }

    return 0;
}

HDU-6063 RXD and math(

打表)

题解：找规律，答案是n^k

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

long long n, k;

const long long MOD=1e9+7;

long long quickpow(long long x, long long y)
{
    long long res=1;
    while(y)
    {
        if(y&1) res=(res*x)%MOD;
        x=((x%MOD)*(x%MOD))%MOD;
        y>>=1;
    }
    return res;
}

int main(){
    int t = 1;
    while(scanf("%lld %lld", &n, &k)!=EOF){
        printf("Case #%d: %lld\n", t++, quickpow(n, k));
    }

    return 0;
}

HDU-6066 RXD‘s date(签到水题)

代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main(){
    int n;
    int cnt = 0;
    scanf("%d", &n);
    for(int i = 1; i<=n; i++){
        int x;
        scanf("%d", &x);
        if(x<=35) cnt++;
    }
    cout<<cnt<<endl;

    return 0;
}