c++ M - Zigzag Gym - 101291M SDUT

Your Ph.D. thesis on properties of integer sequences is coming along nicely. Each chapter is on a
different type of sequence. The first covers arithmetic sequences. Subsequently you cover binomial
sequences, computable sequences, decreasing sequences, and so on. You have one more chapter to
write, on zigzagging sequences.
A sequence is zigzagging if adjacent elements alternate between strictly increasing and strictly
decreasing. The first pair of numbers can be either strictly increasing or strictly decreasing.
For a given sequence, find the length of its longest zigzagging subsequence.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 50), the length of the sequence.
The second line contains n space-separated integers, describing the sequence.
Every number in the sequence is guaranteed to be between 1 and 50, inclusive.

Output

Print, on a single line, the length of a longest zigzagging subsequence of the input sequence.

Sample Input	Sample Output
5	4
2 1 3 4 2

题目大意：在一个序列中求出曲折序列，曲折序列：两个元素严格按照递增递减交替出现，对于第一组元素可以是递增的也可以是递减的，但是这里的曲折序列并不是必须连续的，样例中的答案就应该是2 1 3 2 （递减递增递减）一共四个元素

解题思路：
用到的变量：使用a数组储存原数据，len1储存到该元素为递减的曲折序列的最长长度，len2储存到该元素为递增的曲折序列的最长长度
然后是用动态规划的思想
1.首先初始化len1，len2全部为1

2.从第二个元素开始找，先更新len1中的值，len1中的值为到该元素为递减的曲折序列，所以需要找在该元素之前的递增的曲折序列中最长的即找在len2中该元素之前的最大值。

      if (a[i] < a[j] && len1[i] < len2[j] + 1)
      {
          len1[i] = len2[j] + 1;
      }

同理：在更新len2中的值时，需要找len1中该元素之前的最大值，并以此类推。

    if (a[i] > a[j] && len2[i] < len1[j] + 1)
    {
         len2[i] = len1[j] + 1;
     }

第二个元素更新后

第三个元素更新后

第四个元素更新后

第五个元素更新后

3.找出len1和len2中的最大值

// Zigzag.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, a[52], len1[52], len2[52];
    cin >> n;
    for (int i = 0; i < n; i++)
    //输入数据，并初始化len1,和len2
    {
        cin >> a[i];
        len1[i] = len2[i] = 1;
    }
    
    //动态规划，求最长曲折序列
    for (int i = 1; i < n; i++)
    {
        for (int j = i - 1; j >= 0; j--)
        {
        //求到该元素为递减的曲折序列的最长长度
            if (a[i] < a[j] && len1[i] < len2[j] + 1)
            {
                len1[i] = len2[j] + 1;
            }
         //求到该元素为递增的曲折序列的最长长度
            if (a[i] > a[j] && len2[i] < len1[j] + 1)
            {
                len2[i] = len1[j] + 1;
            }
        }
        
    }
    int Max = 0;//找最大值
    for (int i = 0; i < n; i++)
    {
        if (Max < len1[i])
        {
            Max = len1[i];
        }
        if (Max < len2[i])
        {
            Max = len2[i];
        }
    }
    cout << Max << endl;
}