最长上升子序列问题
Times:3000ms
Wavio is a sequence of integers. It has some interesting properties.
· Wavio is of odd length i.e. L = 2*n + 1.
· The first (n+1) integers of Wavio sequence makes a strictly increasing sequence.
· The last (n+1) integers of Wavio sequence makes a strictly decreasing sequence.
· No two adjacent integers are same in a Wavio sequence.
For example 1, 2, 3, 4, 5, 4, 3, 2, 0 is an Wavio sequence of length 9. But 1, 2, 3, 4, 5, 4, 3, 2, 2 is not a valid wavio sequence. In this problem, you will be given a sequence of integers. You have to find out the length of the longest Wavio sequence which is a subsequence of the given sequence. Consider, the given sequence as :
1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1.
Here the longest Wavio sequence is : 1 2 3 4 5 4 3 2 1. So, the output will be 9.
Input
The input file contains less than 75 test cases. The description of each test case is given below: Input is terminated by end of file.
Each set starts with a postive integer, N(1<=N<=10000). In next few lines there will be N integers.
Output
For each set of input print the length of longest wavio sequence in a line.
Sample Input Output for Sample Input
10 1 2 3 4 5 4 3 2 1 10 19 1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1 5 1 2 3 4 5 | 9 9 1
|
题解:最长上升子序列问题;
由于题目限制时间是3000ms,而N(1<=N<=10000),因此需要使用nlogn的算法,n^2复杂度算法会超时,使用队列进行二分搜索可以将时间复杂度控制在nlogn
// Memory:0Kb ; Time:205ms
#include<iostream>
#include<queue>
#include<string.h>
#include<math.h>
#include<vector>
#include<algorithm>
#define MAXN 10010
using namespace std;
int s[MAXN],e[MAXN],record[MAXN];
vector<int> vec;
vector<int>::iterator it;
int n;
void deal(int d[]){
vec.clear();
d[0]=0;
vec.push_back(record[0]);
for(int a=1;a<n;a++){
if(record[a]>vec.back()){
vec.push_back(record[a]);
}else{
it=lower_bound(vec.begin(),vec.end(),record[a]);
*it=record[a];
}
d[a]=vec.size()-1;
}
}
int main(){
while(cin>>n){
for(int a=0;a<n;a++) cin>>record[a];
memset(s,0,sizeof(s));
memset(e,0,sizeof(e));
deal(s);
reverse(record,record+n);
deal(e);
int ans;
ans=0;
for(int a=0;a<n;a++){
int tmp=min(s[a],e[n-1-a]);
if(tmp>ans) ans=tmp;
}
ans=2*ans+1;
cout<<ans<<endl;
}
return 0;
}