“玲珑杯”ACM比赛 Round #7

官方题解here

A

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 100005;
int a[N],b[N];
int main()
{
    int t,n;
    cin>>t;
    while(t--)
    {
        scanf("%d",&n);
        //int sum1 = 0,sum2 = 0;
        for(int i = 1;i <= n;i++)
        {
            scanf("%d",&a[i]);
            //sum1+=a[i];
        }
        for(int i = 1;i <= n;i++)
        {
            scanf("%d",&b[i]);
            //sum2+=b[i];
        }
        for(int i = 2;i <= n;i++)
            a[i] += a[i-1];
        for(int i = 2;i <= n;i++)
            b[i] += b[i-1];
        sort(a+1,a+1+n);
        sort(b+1,b+1+n);
        bool flag = false;
        for(int i = 1;i <= n;i++)
        {
            if(a[i] != b[i])
            {
                flag = true;
                break;
            }
        }
        if(flag)
            printf("No\n");
        else
            printf("Yes\n");
    }
    return 0;
}
/*
22

*/

B
并查集什么的，并不会写，隔了一周也没什么感觉了，炒的qq_34731703巨巨的

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 100005;

struct node
{
    int num,dep;
    node(int n,int d):num(n),dep(d){}
    bool operator < (const node p)const
    {
        if(dep == p.dep)
            return p.num < num;
        return p.dep > dep;
    }
};

int pre[N],rk[N];
int main()
{
    int t,n,ch,y;
    cin>>t;
    while(t--)
    {
        priority_queue<node> q;
        q.push(node(1,0));
        int x = 1;
        scanf("%d",&n);
        for(int i = 1;i <= n;i++)
        {
            scanf("%d",&ch);
            y = abs(ch);
            if(ch > 0)
            {
                x++;
                pre[x] = y;
                rk[x] = rk[y] + 1;
                q.push(node(x,rk[x]));
                printf("%d\n",q.top().num);
            }
            else
            {
                pre[y] = -1;
                while(true)
                {
                    int k = q.top().num;
                    while(k != 1 && pre[k] != -1)
                        k = pre[k];
                    if(k == 1)
                    {
                        printf("%d\n",q.top());
                        break;
                    }
                    else
                    {
                        while(k != 1 && pre[k] != -1)
                        {
                            int temp = pre[k];
                            pre[k] = -1;
                            k = temp;
                        }
                        q.pop();
                    }
                }
            }
        }
    }
    return 0;
}

C

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int a[100005],b[100005];
int main()
{
    int t,n;
    cin>>t;
    while(t--)
    {
        scanf("%d",&n);
        for(int i = 1;i <= n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a+1,a+1+n);
        int num = 0;
        for(int i = 1;i <= n-1;i++)
        {
            if(a[i] == a[i+1])
            {
                b[num++] = a[i];
                while(a[i] == a[i+1])
                    i++;
            }

        }
        if(num > 0)
        {
            printf("%d",b[0]);
            if(num>1)
            for(int i = 1;i < num;i++)
                printf(" %d",b[i]);
            printf("\n");
        }
        else
            printf("none\n");

    }
}

D

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<list>

using namespace std;

const int INF = 0x3f3f3f3f;
int a[1003],dp[1005][1005];
int main()
{
    int t,n,x;
    cin>>t;
    while(t--)
    {
        //list<int> aa,bb;
        scanf("%d",&n);
        for(int i = 1;i <= n;i++)
        {
            scanf("%d",&a[i]);

        }
        a[0] = a[n+1] = 1;
        for(int i = 1;i <= n;i++)
            for(int j = 1;j <= n;j++)
                dp[i][j]=0;
        for(int i = n;i >= 1;i--)
            for(int j = i;j <= n;j++)
            {
                for(int k = i;k <= j;k++)
                {
                    int tmp = dp[i][k-1] + dp[k+1][j] + a[k]*a[i-1]*a[j+1];
                    if(tmp > dp[i][j])
                        dp[i][j] = tmp;
                }
            }
        printf("%d\n",dp[1][n]);
    }
    return 0;
}