• Codeforces Round #FF (Div. 2):C. DZY Loves Sequences


    C. DZY Loves Sequences
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    DZY has a sequence a, consisting of n integers.

    We'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.

    Your task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.

    You only need to output the length of the subsegment you find.

    Input

    The first line contains integer n (1 ≤ n ≤ 105). The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

    Output

    In a single line print the answer to the problem — the maximum length of the required subsegment.

    Sample test(s)
    Input
    6
    7 2 3 1 5 6
    
    Output
    5
    
    Note

    You can choose subsegment a2, a3, a4, a5, a6 and change its 3rd element (that is a4) to 4.


    题意就是, 你能够改变字符串中的一个字符。 就出其最长的连续字串

    如案列, 7 2 3 1 5 6 —————7 2 3  4 5 6

    输出即为5.




    
    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    #include<vector>
    #include<queue>
    #include<sstream>
    #include<cmath>
    
    using namespace std;
    
    #define f1(i, n) for(int i=0; i<n; i++)
    #define f2(i, m) for(int i=1; i<=m; i++)
    #define f3(i, n) for(int i=n; i>=1; i--)
    #define f4(i, n) for(int i=1; i<=n; i++)
    #define f5(i, n) for(int i=2; i<=n; i++)
    #define M 1005
    
    const int INF = 0x3f3f3f3f;
    int n, a[100005], b[100005];
    
    int main()
    {
        cin>>n;
        f4(i, n)
        cin>>a[i];
        b[1]=1;
        f5(i, n)
        {
            b[i]=1;
            if (a[i]>a[i-1])
                b[i]=b[i-1]+1;
        }
        int ans=-INF;
        f3(i, n)
        {
            if (b[i]==n)
                ans=max(b[i], ans);
            else
                ans=max(ans, b[i]+1);
            if (a[i-b[i]+1]-1>a[i-b[i]-1])
                ans=max(ans,b[i]+b[i-b[i]]);
            if (a[i-b[i]+2]-1>a[i-b[i]])
                ans=max(ans,b[i]+b[i-b[i]]);
        }
        cout<<ans<<endl;
        return 0;
    }
    


  • 相关阅读:
    软阈值迭代算法(ISTA)和快速软阈值迭代算法(FISTA)
    伍德伯里矩阵恒等式(Woodbury matrix identity)
    压缩感知:一种新型亚采样技术
    运输层--------运输层与网络层的关系、UDP、TCP
    单链表的基本操作(二)
    单链表的基本操作(一)
    c++中的数据类型转换
    链表总的首元结点、头结点、头指针的区别
    封装设计基础知识点
    git的使用总结
  • 原文地址:https://www.cnblogs.com/yxwkf/p/5170048.html
Copyright © 2020-2023  润新知