luogu部分题解

最新推荐文章于 2025-03-26 15:09:56 发布

转载最新推荐文章于 2025-03-26 15:09:56 发布 · 62 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ronnielee/p/9530079.html

1068

#include<bits/stdc++.h>

using namespace std;

struct man
{
    int index;
    int score;
}p[5050];

bool cmp(man x, man y)
{
    if(x.score != y.score)
        return x.score > y.score;
    else
        return x.index < y.index;

}
int main()
{
    int m, n;
    cin >> m >> n;
    int ask = floor(1.5*n);
    for(int i = 0 ; i < m ; i++)
        scanf("%d%d",&p[i].index,&p[i].score);
    sort(p, p+m, cmp);

    int u = p[ask-1].score;
    int v = 0;
    for(int i = 0 ; i < m ; i++)
        if(p[i].score >= u)
            v++;

    printf("%d %d\n",u,v);

    for(int i = 0 ; i < ask ; i++)
        printf("%d %d\n",p[i].index,p[i].score);
    for(int i = ask ; i < m ; i++)
    {
        if(p[i].score == p[ask-1].score)
            printf("%d %d\n",p[i].index,p[i].score);
        else return 0;
    }
    return 0;
}

1420

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int p[10010];
    int n;
    cin >> n;
    int ans = 0;
    int max = 0;
    for(int i = 1 ; i <= n; i++)
        scanf("%d",&p[i]);
    for(int i = 1 ; i < n; i++)
    {
        if(p[i+1]-p[i] == 1)    
            ans++;
        else
            ans = 0;
        if(ans>max)
            max = ans;
    }
    cout << max+1 <<endl;
    return 0;
}

转载于:https://www.cnblogs.com/ronnielee/p/9530079.html