ZOJ 2319 最长上升子序列并输出组成该序列的元素编号
来源:互联网 发布:凡科互动游戏 源码 编辑:程序博客网 时间:2024/05/02 01:50
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2319
The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered by the time they entered the club) has strength Si and beauty Bi. Since this is a very prestigious club, its members are very rich and therefore extraordinary people, so they often extremely hate each other. Strictly speaking, i-th member of the club Mr X hates j-th member of the club Mr Y if Si <= Sj and Bi >= Bj or if Si >= Sj and Bi <= Bj (if both properties of Mr X are greater then corresponding properties of Mr Y, he doesn��t even notice him, on the other hand, if both of his properties are less, he respects Mr Y very much).
To celebrate a new 2005 year, the administration of the club is planning to organize a party. However they are afraid that if two people who hate each other would simultaneouly attend the party, after a drink or two they would start a fight. So no two people who hate each other should be invited. On the other hand, to keep the club prestige at the apropriate level, administration wants to invite as many people as possible.
Being the only one among administration who is not afraid of touching a computer, you are to write a program which would find out whom to invite to the party.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Input
The first line of the input file contains integer N - the number of members of the club. (2 <= N <= 100 000). Next N lines contain two numbers each - Si and Bi respectively (1 <= Si, Bi <= 109).
Output
On the first line of the output file print the maximum number of the people that can be invited to the party. On the second line output N integers - numbers of members to be invited in arbitrary order. If several solutions exist, output any one.
Sample Input
1
4
1 1
1 2
2 1
2 2
Sample Output
2
1 4
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>using namespace std;typedef long long LL;const int N=100005;struct note{ int x,y,ip; bool operator < (const note &a) const { if(x==a.x) return y>a.y; return x<a.x; }}point[N];int dp[N],pre[N],n,T,k,l,r,m;int main(){ scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d",&point[i].x,&point[i].y); point[i].ip=i; } sort(point+1,point+n+1); dp[1]=1; k=1; for(int i=2;i<=n;i++) { if(point[i].y>point[dp[k]].y) { pre[i]=dp[k]; dp[++k]=i; } else { l=1,r=k; while(l<r){ m=(l+r)>>1; if(point[dp[m]].y<point[i].y)l=m+1; else r=m; } dp[l]=i; pre[i]=dp[l-1]; } } printf("%d\n",k); int i=dp[k--]; printf("%d",point[i].ip); while(k--) { i=pre[i]; printf(" %d",point[i].ip); } printf("\n"); } return 0;}
- ZOJ 2319 最长上升子序列并输出组成该序列的元素编号
- LCS 最长公共子序列并输出该序列
- zoj 1986(最长上升子序列)
- ZOJ 1076 最长上升子序列
- 【最长上升子序列 && 输出路径】HDU
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- 最长上升子序列
- [Contest Hunter #54]CH NOIP 2014 模拟赛day1被虐记
- ID3DXLine 的用法
- spring的配置文件中mvc:view-controller path使用方法
- 二叉树遍历算法
- c语言中 符号的优先级
- ZOJ 2319 最长上升子序列并输出组成该序列的元素编号
- 数据范围速查表
- 域名备案
- Learn Beautiful Soup(7) —— BeautifulSoup的输出
- Java权限管理系统源代码下载
- 扩展欧几里德算法详解
- 互联网全站HTTPS的时代已经到来
- C++智能指针
- cocos2d_x3.0的触屏事件