Problem - 1148D - Codeforces(思维+排序)

Problem - D - Codeforces

题目大意:现在给定$n$个$pair<a_i,b_i>$,满足$a_i,b_i$不重复且都小于等于$2n$,现在求将这些$pair$选出$k$个$pair$排列,使得形成的序列$a_i{b}_i{a}_j{b}_j....a_n{b}_n$满足
$x_1<x_2>x_3<x_4>.....<x_{2k}$或者满足
$x_1>x_2<x_3>x_4<.....>x_{2k}$,求最大的$k$,以及构造之后的对应$pair$的下标.

解题思路:很好想的一点是,如果要满足第一种构造,那么所有选用的$pair$应该满足$a_i<b_i$,对于另一种构造所有的$pair$需要满足$a_i>b_i$,然后对于两种构造的$pair$拍个序.
对于第一种,将$a_i$按降序排序,因为这样$a_1>a_2$,且$b_1>a_1$,推得$a_1<b_1<a_2$,然后可依次向下推导.
对于第二种构造,将$b_i$按升序排序,$a_1>b_1,b_2>b_1,a_2>b_2$则有$a_2>b_1$就满足$a_1>b_1<a_2$,可依次向下推导.

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define syncfalse ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int N = 3e5+5;
struct node{
    int a, b, id;
}c[N];

bool cmpa(node&x, node&y){
    return x.a > y.a;
}

bool cmpb(node&x, node&y){
    return x.b < y.b;
}

int main(){
    syncfalse
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    int n;
    cin>>n;
    for (int i = 1; i <= n; ++i){
        cin>>c[i].a>>c[i].b;
        c[i].id=i;
    }
    vector<node>ans1, ans2;
    for (int i = 1; i <= n; ++i){
        if (c[i].b>c[i].a)ans1.push_back(c[i]);
        else ans2.push_back(c[i]);
    }
    sort(ans1.begin(), ans1.end(), cmpa);
    sort(ans2.begin(), ans2.end(), cmpb);
    if (ans1.size()>ans2.size()){
        cout << ans1.size() << "\n";
        for (auto x : ans1)cout << x.id << " ";
    }else{
        cout << ans2.size() << "\n";
        for (auto x : ans2)cout << x.id << " ";
    }

    return 0;
}