Sicily 1448. Antimonotonicity_line 1448-CSDN博客

本文链接：https://blog.csdn.net/u012925008/article/details/44343105

本文介绍了一道算法题目，目标是在给定整数序列中找出满足特定反单调条件的最长子序列。文章提供了完整的代码实现，采用C++语言，并通过输入样例展示了算法的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1448. Antimonotonicity

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:

   Mary[0] > Mary[1] < Mary[2] > Mary[3] < ...

Input

The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.

Each test case is contained on a single line. A line describing a test case is formatted as follows:

   n Fred[0] Fred[1] Fred[2] ... Fred[n-1].

where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.

Output

For each test case, output a single integer followed by a newline --- the length of the longest subsequence Mary of Fred with the desired properties.

Sample Input

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

Sample Output

1
2
5
3
// Problem#: 1448
// Submission#: 3391238
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
// Problem#: 1448
// Submission#: 3390774
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>
#include <string.h>
#include <math.h>
using namespace std;

const int MAX_N = 30005;

int n[MAX_N];
int N;

int main() {

    std::ios::sync_with_stdio(false);

    int caseNum;
    cin >> caseNum;

    while (caseNum--) {
        
        cin >> N;
        for (int i = 0; i < N; i++) cin >> n[i];

        int ans = 1;
        int i;

        for (i = 0; i < N - 1;) {
            for (; i < N - 1; i++) {
                if (n[i] > n[i + 1]) {
                    ans++;
                    break;
                }
            }
            i++;
            for (; i < N - 1; i++) {
                if (n[i] < n[i + 1]) {
                    ans++;
                    break;
                }
            }
            i++;
        }

        cout << ans << endl;

    }

    return 0;
}