Codeforces Round #FF 446A DZY Loves Sequences
来源:互联网 发布:图片数据库 编辑:程序博客网 时间:2024/06/04 23:33
预处理出每个数字可以向后延伸多少,然后尝试将两段拼起来。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n,a[110000],dp[110000];int main(){scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",a+i);int nx=-1;for(int i=0;i<n;i++){if(nx>i) {dp[i]=nx-i;continue;}int j=i;while(j+1<n&&a[j]<a[j+1]) j++;dp[i]=j-i+1;nx=max(nx,j+1);}int ans=dp[0];for(int i=0;i<n;i++){int p=dp[i]+i-1;if(p-1>=0&&p+1<n&&a[p+1]>a[p-1]+1){ans=max(ans,dp[i]-1+dp[p+1]+1);}if(p+2<n&&a[p+2]>a[p]+1){ans=max(ans,dp[i]+dp[p+2]+1);}if(p+1<n||i-1>=0) ans=max(ans,dp[i]+1);i=p;}printf("%d\n",ans);return 0;}
2 0
- Codeforces Round #FF 446A DZY Loves Sequences
- Codeforces Round #FF (Div. 2)446A - DZY Loves Sequences(最长上升子序列变形)
- Codeforces Round #FF (Div. 2):C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) Problem C DZY Loves Sequences
- Codeforces Round #FF (Div. 2)C - DZY Loves Sequences
- Codeforces Round #FF (Div. 2)-C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2)C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) C. DZY Loves Sequences
- Codeforces Round #FF (Div. 二):C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) C DZY Loves Sequences
- Codeforces Round #FF (Div. 2)C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2)C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2)-C. DZY Loves Sequences
- Codeforces Round #FF (Div. 2) C. DZY Loves Sequences
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
- Codeforces 446A DZY Loves Sequences
- CodeForces 446A DZY Loves Sequences
- 黑马程序员——抽象类、接口和内部类
- 解决Failure executing javac, but could not parse the error
- jsp简单练习-简单的下拉表单
- mysql中 如果有记录则修改 无记录则插入 的 几种方法
- JAX-WS 构建简单webservice部署到tomcat上
- Codeforces Round #FF 446A DZY Loves Sequences
- Linux内核数据结构—链表
- FFT的详细解释
- [Python]入门教程(四):Python中的函数
- POJ 1316 Self Numbers
- 我最喜欢的10条编程语录
- [Python]入门教程(五):Python中的模块
- hw7
- Space Station Shielding(洪泛算法)