CodeForces 702A Maximum Increase
2016-07-30 16:05
323 查看
注意要求的是最长递增子串,不是子序列,由于要求连续,所以只需要看是否比前一个数大
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[100050];
int a[100050];
int main()
{
int n,M=1;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
dp[i]=1;
}
for(int i=0;i<n;i++)
{
if(a[i]>a[i-1]) dp[i]=dp[i-1]+1;
M=max(M,dp[i]);
}
printf("%d\n",M);
return 0;
}
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[100050];
int a[100050];
int main()
{
int n,M=1;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
dp[i]=1;
}
for(int i=0;i<n;i++)
{
if(a[i]>a[i-1]) dp[i]=dp[i-1]+1;
M=max(M,dp[i]);
}
printf("%d\n",M);
return 0;
}
相关文章推荐
- CodeForces 702A Maximum Increase
- codeforces 702A Maximum Increase
- Codeforces 472G Design Tutorial: Increase the Constraints(分块+FFT)
- Codeforces 246B-Increase and Decrease【模拟】
- Codeforces 466D Increase Sequence(dp+组合数学)
- CodeForces 246B B. Increase and Decrease【思维】
- 【Codeforces 246B Increase and Decrease 】
- CodeForces - 246B Increase and Decrease (模拟)水
- Codeforces 246B Increase and Decrease 【数学】
- Codeforces 466D Increase Sequence【思维】好题~
- Maximum Increase CodeForces - 702A *
- CodeForces 246B Increase and Decrease
- Codeforces 466 D. Increase Sequence
- 【codeforces 466D】Increase Sequence
- 【CODEFORCES】 D. Increase Sequence
- CodeForces 702A Maximum Increase (DP)
- codeforces 466d Increase Sequence
- Increase and Decrease--codeForces 246B
- CodeForces - 702A Maximum Increase (dp最长严格递增子串)
- Codeforces 246B Increase and Decrease