“玲珑杯”ACM比赛 Round #7

 A

#include<bits/stdc++.h>
#include<time.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
const int INF = 0x3f3f3f3f;
const int N = 100005;
const int maxs = 1e6+5;
const double eps = 1e-10;
#define left lll
#define right rrr
#define FOR(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
typedef long long LL;
int a[maxs],b[maxs],sum[maxs],sum1[maxs];
int t,n,flag,cnt;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        flag=1;
        scanf("%d",&n);
        sum1[0]=0;
        for(int i=1; i<=n; i++)
            {
                scanf("%d",&a[i]);
                sum1[i]=sum1[i-1]+a[i];
            }
        sum[0]=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&b[i]);
            sum[i]=sum[i-1]+b[i];
//            printf("%d ",sum[i]);
        }
        sort(sum1,sum1+n);
        sort(sum,sum+n);
        for(int i=1; i<=n; i++)
            if(sum1[i]!=sum[i])
            {
                flag=0;
                break;
            }
        if(flag==0)
            printf("No\n");
        else printf("Yes\n");

    }
    return 0;
}

C

#include<bits/stdc++.h>
#include<time.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
const int INF = 0x3f3f3f3f;
const int N = 100005;
const int maxs = 1e6+5;
const double eps = 1e-10;
#define left lll
#define right rrr
#define FOR(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
typedef long long LL;
int a[maxs];
int main()
{
    int n,t,g;
    scanf("%d",&t);
    while(t--)
    {
        map<int,int>p;
        scanf("%d",&n);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
            p[a[i]]++;
        }
        sort(a,a+n);
        for(int i=n-1;i>=0;i--)
        {
           if(p[a[i]]>=2)
           {
              g=a[i];
              break;
           }
        }
//        printf("%d\n",g);
        int m=0,flag=1;
        for(int i=0; i<n; i++)
        {
            if(a[i]==a[i+1])
                m++;
            else if(a[i]!=a[i+1])
            {
                if(m>0)
                {
                    if(a[i]==g)  printf("%d",a[i]);
                    else  printf("%d ",a[i]);
                    flag=0;
                }
                m=0;
            }
        }
//        printf("m=%d\n",m);
        if(flag==1)
            printf("none\n");
        else
        {

            printf("\n");
        }
    }
}