UVa 10534 - Wavio Sequence （简单DP 最长上升下降子序列）

最新推荐文章于 2020-04-17 09:07:06 发布

zhaosdfa

最新推荐文章于 2020-04-17 09:07:06 发布

阅读量519

点赞数

分类专栏：算法竞赛入门经典训练指南-第一章 DP ACM

本文链接：https://blog.csdn.net/zhaosdfa/article/details/38173185

版权

ACM 同时被 3 个专栏收录

172 篇文章 1 订阅

订阅专栏

算法竞赛入门经典训练指南-第一章

42 篇文章 0 订阅

订阅专栏

39 篇文章 0 订阅

订阅专栏

Wavio Sequence

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit] [Go Back] [Status]

Description

Problem D
Wavio Sequence
Input: Standard Input

Output: Standard Output

Time Limit: 2 Seconds

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

1 2 3 4 5 4 3 2 1 10

1 2 3 2 1 2 3 4 3 2 1 5 4 1 2 3 2 2 1

1 2 3 4 5

Problemsetter: Md. Kamruzzaman, Member of Elite Problemsetters' Panel

题意：

给定长度为ｎ的整数序列，求一个最长子序列（不一定连续），使得该子序列的长度为奇数（2*k-1），前ｋ个数严格递增，后ｋ个数严格递减。

先求出以每个点为终点的最长上升和下降子序列，然后以该点为中心的波浪序列长度就是min(inc[i], dec[i]) * 2 - 1

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>

using namespace std;

//#define WIN
#ifdef WIN
typedef __int64 LL;
#define iform "%I64d"
#define oform "%I64d\n"
#define oform1 "%I64d"
#else
typedef long long LL;
#define iform "%lld"
#define oform "%lld\n"
#define oform1 "%lld"
#endif

#define S64I(a) scanf(iform, &(a))
#define P64I(a) printf(oform, (a))
#define P64I1(a) printf(oform1, (a))
#define REP(i, n) for(int (i)=0; (i)<n; (i)++)
#define REP1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FOR(i, s, t) for(int (i)=(s); (i)<=(t); (i)++)

const int INF = 0x3f3f3f3f;
const double eps = 10e-9;
const double PI = (4.0*atan(1.0));

const int maxn = 10000 + 20;
int A[maxn];
int deca[maxn];
int inca[maxn];
int g[maxn];

int main() {
    int n;

    while(scanf("%d", &n) != EOF) {
        for(int i=0; i<n; i++) scanf("%d", &A[i]);
        memset(g, 0x3f, sizeof(g));
        for(int i=0; i<n; i++) {
            int t = lower_bound(g+1, g+n+1, A[i]) - g;
            inca[i] = t;
            g[t] = A[i];
        }
        memset(g, 0x3f, sizeof(g));
        for(int i=n-1; i>=0; i--) {
            int t = lower_bound(g+1, g+n+1, A[i]) - g;
            deca[i] = t;
            g[t] = A[i];
        }
        int ans = 0;
        for(int i=0; i<n; i++) {
            ans = max(ans, min(deca[i], inca[i]) * 2 - 1);
        }
        printf("%d\n", ans);
    }

    return 0;
}