包子 - Problem Solution

0
Guest MOD
- Guest

-3

王奕霖 (lqst2025017) LV 10 MOD @ 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;
}

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

银河xy (影蓝银河) @ 2025-12-30 17:28:32

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

刘丛睿 (lqst2025013) @ 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;
}

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

View all 2 solutions

ID: 97
Time: 1000ms
Memory: 256MiB
Difficulty: 6
Tags: (None)
# Submissions: 78
Accepted: 23
Uploaded By: Hydro

2 solutions

包子

Information

Status

Development

Support

2 solutions

包子

Information

Status

Development

Support

Don't have an account?

SIGN IN