线段树维护DP
令f[i][j][0/1]表示前i个点,选择j段,最后一段是下降/上升的方案数。
f[i][j][0]=∑(f[k][j][0]+f[k][j-1][1]) (k < i且a[k].y>a[i].y)
f[i][j][1]=∑(f[k][j][1]+f[k][j-1][0]) (k < i且a[k].y
#include<cstdio>
#include<algorithm>
#define N 50005
#define K 12
#define MOD 100007
struct Point{int x, y;}p[N];
struct segment_tree
{
int l, r, v;
segment_tree(){v=0;}
}t[K][N*10][2];
int temp[N], f[N][K][2];
using namespace std;
bool cmp(Point a, Point b){return a.x<b.x;}
bool cmp1(int a, int b){return p[a].y<p[b].y;}
void build(int x, int kk, int op, int l, int r)
{
t[kk][x][op].l=l;
t[kk][x][op].r=r;
if(l==r)return;
int mid=(l+r)>>1;
build(x<<1,kk,op,l,mid);
build(x<<1|1,kk,op,mid+1,r);
}
int query(int x, int kk, int op, int l, int r)
{
if(l<=t[kk][x][op].l && t[kk][x][op].r<=r)return t[kk][x][op].v;
int mid=(t[kk][x][op].l+t[kk][x][op].r)>>1;
int ret=0;
if(l<=mid)ret+=query(x<<1,kk,op,l,r);
if(mid+1<=r)ret+=query(x<<1|1,kk,op,l,r);
return ret;
}
void modify(int x, int kk, int op, int pos, int v)
{
if(t[kk][x][op].l==t[kk][x][op].r)
{
t[kk][x][op].v=v;
return;
}
int mid=(t[kk][x][op].l+t[kk][x][op].r)>>1;
if(pos<=mid)modify(x<<1,kk,op,pos,v);
else modify(x<<1|1,kk,op,pos,v);
t[kk][x][op].v=(t[kk][x<<1][op].v+t[kk][x<<1|1][op].v)%MOD;
}
int main()
{
int n, k, ans=0;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++)
scanf("%d%d",&p[i].x,&p[i].y);
sort(p+1,p+1+n,cmp);
for(int i = 1; i <= n; i++)temp[i]=i;
sort(temp+1,temp+1+n,cmp1);
for(int i = 1; i <= n; i++)p[temp[i]].y=i;
for(int j = 0; j <= k; j++)
{
build(1,j,0,1,n);
build(1,j,1,1,n);
}
for(int i = 1; i <= n; i++)
{
modify(1,0,0,p[i].y,1);
modify(1,0,1,p[i].y,1);
for(int j = 1; j <= k; j++)
{
f[i][j][0]=(query(1,j,0,p[i].y+1,n)+query(1,j-1,1,p[i].y+1,n))%MOD;
f[i][j][1]=(query(1,j,1,1,p[i].y-1)+query(1,j-1,0,1,p[i].y-1))%MOD;
modify(1,j,0,p[i].y,f[i][j][0]);
modify(1,j,1,p[i].y,f[i][j][1]);
}
}
for(int i = 1; i <= n; i++)
{
ans=(ans+f[i][k][0])%MOD;
ans=(ans+f[i][k][1])%MOD;
}
printf("%d\n",ans);
}