T2(Help Yourself 1)
题目
分析:
设s[i]为坐标小于等于i的右端点个数
DP递推式:f[i]=2*f[i-1]+2^s[i]-1
答案:f[n]
证明:当我们从f[i-1]转移到f[i]的时候,新增了一条线段i,我们可以选或不选它,这样总复杂度×2。我们只考虑选了线段i之后发生的变化。由“不与线段i相交的线段且编号小于i的线段”组成的子集在加上线段i之后复杂度+1。这样的子集一共有2^(不与线段i相交的线段且编号小于i的线段的个数)个。
C++代码:
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i;
long long s[200005],f[100005];
struct node
{
long long l,r;
}a[100005];
bool cmp(node x,node y)
{
return x.l<y.l;
}
long long ksm(long long x,long long y)
{
long long ans=1;
while(y)
{
if (y%2==1) ans=ans*x%1000000007;
x=x*x%1000000007;
y/=2;
}
return ans;
}
int main()
{
freopen("help.in","r",stdin);
freopen("help.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d%d",&a[i].l,&a[i].r);
s[a[i].r]++;
}
sort(a+1,a+n+1,cmp);
for (i=1;i<=2*n;i++)
s[i]+=s[i-1];
for (i=1;i<=n;i++)
f[i]=(2*f[i-1]+ksm(2,s[a[i].l-1]))%1000000007;
printf("%d\n",f[n]);
fclose(stdin);
fclose(stdout);
return 0;
}