zoukankan      html  css  js  c++  java
  • (DP) poj 3298

    Antimonotonicity
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 2913   Accepted: 1266

    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:

    Mary0 > Mary1 < Mary2 > Mary3 < ...

    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 Fred0 Fred1 Fred2 ... Fredn-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

    Source

    拐点数+1

     

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<string>
    #include<algorithm>
    #include<cstdlib>
    using namespace std;
    int tt,a[30005];
    int main()
    {
        int n,x1,x2,k;
        scanf("%d",&tt);
        while(tt--)
        {
            scanf("%d",&n);
            int ans=1;
            scanf("%d",&x1);
            k=2;
            for(int i=2;i<=n;i++)
            {
                scanf("%d",&x2);
                if(x1>x2&&k!=1)
                {
                    k=1;
                    ans++;
                }
                if(x1<x2&&k!=2)
                {
                    k=2;
                    ans++;
                }
                x1=x2;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    开始Flask项目
    夜间模式的开启与关闭,父模板的制作
    从首页问答标题到问答详情页
    首页列表显示全部问答,完成问答详情页布局
    制作首页的显示列表
    发布功能完成
    登录之后更新导航
    完成登录功能,用session记住用户名
    完成注册功能
    通过用户模型,对数据库进行增删改查操作
  • 原文地址:https://www.cnblogs.com/water-full/p/4474130.html
Copyright © 2011-2022 走看看