2 solutions

  • 0
  • 2
    @ 2026-3-25 18:09:03

    using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

    ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

    `
这道题还算比较简单，自行观看吧
    • -3
      @ 2025-7-12 19:58:18 
      using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

```
`
这道题还算比较简单，自行观看吧
      • @ 2025-12-30 17:28:32

        你是人么？搞什么骚操作呕

      • @ 2026-3-25 18:09:28

        @ using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧using namespace std; int main() { int n; int a[100000]; cin >> n; for(int i = 0;i < n;i++) { cin >> a[i]; } sort(a,a+n); int cnt = 1; int sum = 1; int max = 0; for(int i = 1;i < n;i++) { if(a[i] == a[i-1]) { sum++; } else { cnt++; if(sum >= max) { max = sum; } sum = 1; } } cout<<max<<" "<<cnt; return 0; }

        `
这道题还算比较简单，自行观看吧using namespace std;
int main()
{
    int n;
    int a[100000];
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    int cnt = 1;
    int sum = 1;
    int max = 0;
    for(int i = 1;i < n;i++)
    {
        if(a[i] == a[i-1])
        {
            sum++;
        }
        else
        {
            cnt++;
            if(sum >= max)
            {
                max = sum;
            }
            sum = 1;
        }
    }
    cout<<max<<" "<<cnt;
    return 0;
}

        ` 这道题还算比较简单，自行观看吧

    • 1

    包子

    Information

    ID
    97
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    6
    Tags
    (None)
    # Submissions
    78
    Accepted
    23
    Uploaded By
    1. About
    2. Contact Us
    3. Privacy
    4. Terms of Service
    5. Copyright Complaint
    6. Language
    7. Legacy mode
    8. Theme
    3. Worker 0, 346ms
    4. Powered by Hydro v4.19.1 Community