D. Dirty Deeds Done Dirt Cheap
theme:给定n个二元组,所有元素各不相同,且在[1,2n]之间。先要你选出t个二元组,使得满足按a1 b1 a2 b2...at bt写开后满足a1>b1 < a2>b2 <...< at>bt 或 a1<b1 > a2<b2 >...> at<bt求最大的t及排列顺序。1<=n<=3e5
solution:首先我们发现可以将二元组分成两类ai>bi与ai<bi,这样可以分别构造出第一、二种情况。分好类后可发现:
a1>b1
a2>b2
...
at>bt
要构造
a1>b1 < a2>b2 <...< at>bt 或 a1<b1 > a2<b2 >...> at<bt,只要使得b1>a2 , b2>a3...bn-1>an即可,又知道a1>b1,所以只要a2>a1,则b1必然<a2,所以只需将i>bi类按ai从小到大排序即可。可知该类所有元素都可选。
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#define far(i,t,n) for(int i=t;i<n;++i)
#define pb(a) push_back(a)
#define lowbit(x) x&(-x)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int inf=0x3f3f3f3f;
int mod=998244353;
const int maxn=300010;
struct _a
{
int i,a,b;
_a(int x,int y,int z)
{
i=x;
a=y;
b=z;
}
};
vector<_a>big,small;
bool cmpbig(_a a,_a b)
{
return a.a<b.a;
}
bool cmpsmall(_a a,_a b)
{
return a.a>b.a;
}
int main()
{
int n;
cin>>n;
far(i,0,n)
{
int a,b;
scanf("%d%d",&a,&b);
if(a>b)
big.pb(_a(i,a,b));
else
small.pb(_a(i,a,b));
}
int szb=big.size(),szs=small.size();
if(szb>=szs)
{
cout<<szb<<endl;
sort(big.begin(),big.end(),cmpbig);
far(i,0,szb)
printf("%d ",big[i].i+1);
puts("");
}
else
{
cout<<szs<<endl;
sort(small.begin(),small.end(),cmpsmall);
far(i,0,szs)
printf("%d ",small[i].i+1);
puts("");
}
}