CodeForces 580A Kefa and First Steps
2016-04-30 11:30
218 查看
题意:求最长不递减子序列
思路:直接扫一遍就好了...
Description
Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n)
he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequenceai.
Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.
Help Kefa cope with this task!
Input
The first line contains integer n (1 ≤ n ≤ 105).
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.
Sample Input
Input
Output
Input
Output
Hint
In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.
In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
思路:直接扫一遍就好了...
#include<bits/stdc++.h> using namespace std; const int maxn = 1e5+6; int ans = 0; int a[maxn]; int anss = 0; int main() { int n; scanf("%d",&n); for (int i = 1;i<=n;i++) scanf("%d",&a[i]); for (int i = 2;i<=n;i++) { if (a[i]>=a[i-1]) { anss++; ans = max(ans,anss); } else anss=0; } printf("%d\n",ans+1); }
Description
Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n)
he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequenceai.
Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.
Help Kefa cope with this task!
Input
The first line contains integer n (1 ≤ n ≤ 105).
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.
Sample Input
Input
6 2 2 1 3 4 1
Output
3
Input
3 2 2 9
Output
3
Hint
In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.
In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
相关文章推荐
- 设计模式书籍总结
- 对照Java学习Swift--方法(Methods)
- HDU 1856 -More is better
- Android之Style简化代码
- HDU Walk (概率DP)
- CDHtmlDialog的基本使用(C++调用JS函数的实现)
- 摩天轮社区在哪里??风景还是很好看的
- 窗口事件
- 深入浅出ES6(十六):模块 Modules
- Smart20学习记录----异步通知
- 参数table_open_cache
- 如何在html中添加分享按钮
- 虚拟内存的使用--Redis学习笔记九
- A. Tiling
- 剑指offer(57):字符流中第一个不重复的字符
- JavaScript 基础回顾——数组
- 1012. 数字分类 (20)
- 替换空格
- php动态读取数据清除最右边距
- JavaScript 基础回顾——函数