Codeforces-580A Kefa and First Steps

Kefa and First Steps
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 sequence ai. 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.

Examples
Input
6
2 2 1 3 4 1
Output
3
Input
3
2 2 9
Output
3
Note
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.
问题链接：
http://codeforces.com/problemset/problem/580/A
问题简述：
第一次输入n表示你接下来要输入多少个数字，第二次输入相应数量的数字a1-an 求输入的数字中最长的连续递增子序列（相等也算）
问题分析：
从左到右连续递增（相等也行），则需要一个地方存最大值 再设一个temp作计数器 ，当temp加到最大时比较temp是否大于max 来判断是否需要将temp值赋值给max 最后注意用long long ！
代码：

#include <iostream>
using namespace std;
int main()
{
	long long int n, a[100005];
	cin >> n;
	for(int i=0;i<n;i++)
	{
		cin >> a[i];
	}
	int temp = 1, max1=1;
	for (int j = 1; j < n; j++)
	{
		if (a[j] >= a[j - 1]) temp++;
		else temp = 1;//重置

		if (temp > max1)
			max1 = temp;
	}
	cout << max1 << endl;
	return 0;
}