3 条题解

  • 1
    @ 2024-9-23 14:09:55

    #include<stdio.h> int main(){ int n,a,i,max,t; scanf("%d",&n); while(n--) { scanf("%d",&a); int arr[100]; int b[100001]={0}; for(i=0;i<a;i++) { scanf("%d",&arr[i]); b[arr[i]]++; } max=0; for(i=0;i<a;i++) { if(b[arr[i]]>max){ max=b[arr[i]]; t=arr[i]; } } printf("%d %d\n",t,max); }

    return 0;
    

    }

    • 0
      @ 2025-9-13 17:11:37

      还是熟悉的Counter

      from math import sqrt, ceil, gcd, log;re = lambda: map(int, input().strip().split());from collections import Counter
      
      t, = re()
      for _ in range(t):
          n, = re()
          print(*Counter(re()).most_common(1)[0])
      
      • 0
        @ 2023-10-10 21:19:05
        #include <stdio.h>
        #include <string.h>
        
        #define N 100010
        
        int a[N];
        int main()
        {
            int n, m, i, t, p, ans;
            scanf("%d", &n);
            while (n--)
            {
                memset(a, 0, sizeof(a));
                ans = 0;
                scanf("%d", &m);
                for (i = 0; i < m; i++)
                {
                    scanf("%d", &t);
                    a[t]++;
                }
                for (i = 0; i < N; i++)
                {
                    if (a[i] > ans)
                    {
                        p = i;
                        ans = a[i];
                    }
                }
                printf("%d %d\n", p, ans);
            }
            return 0;
        }
        
        • 1

        信息

        ID
        158
        时间
        3000ms
        内存
        128MiB
        难度
        7
        标签
        (无)
        递交数
        979
        已通过
        251
        上传者