HDU Problem 5773 The All-purpose Zero 【LIS】
来源:互联网 发布:常见协议的端口号 编辑:程序博客网 时间:2024/05/16 08:21
The All-purpose Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1562 Accepted Submission(s): 747
Problem Description
?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same interger).?? wants you to help him to find out the length of the longest increasing (strictly) subsequence he can get.
Input
The first line contains an interger T,denoting the number of the test cases.(T <= 10)
For each case,the first line contains an interger n,which is the length of the array s.
The next line contains n intergers separated by a single space, denote each number in S.
For each case,the first line contains an interger n,which is the length of the array s.
The next line contains n intergers separated by a single space, denote each number in S.
Output
For each test case, output one line containing “Case #x: y”(without quotes), where x is the test case number(starting from 1) and y is the length of the longest increasing subsequence he can get.
Sample Input
272 0 2 1 2 0 561 2 3 3 0 0
Sample Output
Case #1: 5Case #2: 5HintIn the first case,you can change the second 0 to 3.So the longest increasing subsequence is 0 1 2 3 5.
Author
FZU
Source
2016 Multi-University Training Contest 4
Recommend
wange2014 | We have carefully selected several similar problems for you: 5831 5830 5829 5828 5827
这道题比较麻烦的是零比较难处理。如果将零拿出来,有一个bug是零不起作用(例如:1,0,2)。但是我在博客上学到一种巧妙地处理方法——把每个数减去前面零的个数,这样当遇到上面的问题时就会巧妙地避开。
#include <bits/stdc++.h>using namespace std;const int MAXN = 100010;const int INF = 0x3f3f3f3f;int ar[MAXN], g[MAXN], dp[MAXN], a[MAXN];int main() { int t , cut = 0; scanf("%d", &t); while (t--) { int C0 = 0, cnt = 0; int n; scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } for (int i = 1; i <= n; i++) { if (a[i] == 0) C0++; else { a[i] -= C0; ar[++cnt] = a[i]; g[cnt] = INF; } } int ans = 0; for (int i = 1; i <= cnt; i++) { int k = lower_bound(g + 1, g + 1 + cnt, ar[i]) - g; dp[i] = k; g[k] = min(g[k], ar[i]); ans = max(dp[i], ans); } printf("Case #%d: %d\n", ++cut, ans + C0); } return 0;}
0 0
- HDU Problem 5773 The All-purpose Zero 【LIS】
- HDU 5773 The All-purpose Zero lis
- hdu 5773 The All-purpose Zero (LIS)
- HDU-The All-purpose Zero(LIS)
- HDU 5773 The All-purpose Zero(LIS特殊处理)
- Hdu-5773 The All-purpose Zero(LIS变形)
- HDU 5773 The All-purpose Zero (LIS)
- HDU 5773 The All-purpose Zero ( LIS 变形 )
- HDU 5773 The All-purpose Zero(贪心LIS)
- hdu 5773 The All-purpose Zero 思维转化+nlogn LIS
- HDU 5773 The All-purpose Zero(LIS)
- HDU 5773 The All-purpose Zero(LIS+贪心思维)
- HDU 5773 The All-purpose Zero(LIS)
- 【HDU】-5773-The All-purpose Zero(LIS变形,思维)
- HDU 5773 The All-purpose Zero DP,贪心,LIS
- HDU 5773 The All-purpose Zero (LIS变形)
- HDU 5773 The All-purpose Zero【LIS变形】
- HDU 5773 The All-purpose Zero【LIS变形】
- Android初级教程:Android中解析方式之pull解析
- Google Play 无法登陆 or 下载很慢怎么办?用Apk-Downloaders.com下载Google Play 的应用
- gpg加密解密
- WiFi基本知识
- 1072 威佐夫游戏(不要求精确度)
- HDU Problem 5773 The All-purpose Zero 【LIS】
- webpack实践指南
- poj 1408
- 判断网络
- 深入学习百度地图Android SDK v4.0.0【第一关】基础地图
- ruby 类,全局变量和 类变量
- tomcat实现多端口、多域名访问
- ListView Item点击不生效的处理办法
- 在ubuntu14.04上安装vmware12专业版