Codeforces Round #FF (Div. 二):C. DZY Loves Sequences
2014-07-16 11:01
351 查看
Description
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 Input
Input
Output
Hint
You can choose subsegment a2, a3, a4, a5, a6
and change its 3rd element (that is a4) to 4.
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
const int N = 100001;
int n, a
;
int f
, g
, ans;
int main(){
while(~scanf("%d", &n))
{
for(int i=0; i<n; i++)
{
scanf("%d", a+i);
if(i!=0)
{
if(a[i]>a[i-1])
f[i]=f[i-1]+1;
else
f[i] = 1;
}
else
f[i] = 1;
}
/*if(n==1)
{
puts("1");
}*/
g[n-1] = 1;
for(int i=n-2; i>=0; i--)
{
if(f[i]<f[i+1])
g[i] = g[i+1]+1;
else
g[i] = 1;
}
ans = max(g[1], f[n-2])+1;
for(int i=1; i<n-1; i++){
if(a[i+1]-a[i-1]>1)
{
ans = max(ans, f[i-1]+g[i+1]+1);
}
else
{
ans = max(ans, f[i-1]+1);
ans = max(ans, g[i+1]+1);
}
}
printf("%d\n", ans);
}
return 0;
}
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 Input
Input
6 7 2 3 1 5 6
Output
5
Hint
You can choose subsegment a2, a3, a4, a5, a6
and change its 3rd element (that is a4) to 4.
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
const int N = 100001;
int n, a
;
int f
, g
, ans;
int main(){
while(~scanf("%d", &n))
{
for(int i=0; i<n; i++)
{
scanf("%d", a+i);
if(i!=0)
{
if(a[i]>a[i-1])
f[i]=f[i-1]+1;
else
f[i] = 1;
}
else
f[i] = 1;
}
/*if(n==1)
{
puts("1");
}*/
g[n-1] = 1;
for(int i=n-2; i>=0; i--)
{
if(f[i]<f[i+1])
g[i] = g[i+1]+1;
else
g[i] = 1;
}
ans = max(g[1], f[n-2])+1;
for(int i=1; i<n-1; i++){
if(a[i+1]-a[i-1]>1)
{
ans = max(ans, f[i-1]+g[i+1]+1);
}
else
{
ans = max(ans, f[i-1]+1);
ans = max(ans, g[i+1]+1);
}
}
printf("%d\n", ans);
}
return 0;
}
相关文章推荐
- Codeforces Round #FF (Div. 2/C)/Codeforces446A_DZY Loves Sequences(DP)
- Codeforces Round #FF (Div. 2) C DZY Loves Sequences
- DP Codeforces Round #FF (Div. 1) A. 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 (DP)
- Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
- Codeforces Round #FF (Div. 2):C. 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) C. 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. 1) A. 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 Round #FF (Div. 2)-C. DZY Loves Sequences