zp2132_a.cpp

一个acm题目系统会自动删除debug和release目录

#include<iostream>
using namespace std;
int main(int argc, char* argv[])
{
  int ra[5010],c[5010],n,i,j,t,a,s,max1;
  int pa[60][4],p[60][4],w[110],v[110],ii,in,av,k;
  while (cin>>n)
  {
    if (n>5000) av=n/5000+1;
    else av=1;
    if (av%2==0) av++;
    for (k=0;k<av;k++)
    {
      s=0;
      ii=1+n/av*k;
      if (k==av-1) in=n; else in=ii+n/av-1;
      for (i=ii;i<=in;i++)
      {
        t=1;
        cin>>a;
        for (j=1;j<=s;j++)
          if (ra[j]==a) {c[j]++;t=0;break;}
        if (t) {s++;ra[s]=a;c[s]=1;}
      }
      c[0]=0;
      max1=0;
      for (i=1;i<=s;i++)
        if (c[i]>c[max1])
          max1=i;
      pa[k][1]=ra[max1]; p[k][1]=c[max1]; c[max1]=0;
      max1=0;
      for (i=1;i<=s;i++)
        if (c[i]>c[max1])
          max1=i;
      pa[k][2]=ra[max1]; p[k][2]=c[max1]; c[max1]=0;
      max1=0;
      for (i=1;i<=s;i++)
        if (c[i]>c[max1])
          max1=i;
      pa[k][3]=ra[max1]; p[k][3]=c[max1];
    }
    if (av==1)
      cout<<pa[0][1]<<endl;
    else
    {
      s=0;
      for (i=0;i<av;i++)
        for (j=1;j<=av;j++)
        {
          t=1;
          for (k=1;k<=s;k++)
            if (w[k]==pa[i][j])
            { v[k]+=p[i][j]; t=0; break;}
          if (t) {s++;w[s]=pa[i][j];v[s]=p[i][j];}
        }
      max1=0;
      for (i=1;i<=s;i++)
        if (v[i]>v[max1]) max1=i;
      cout<<w[max1]<<endl;
    }
  }
  return 0;
}