Codeforces 580A. Kefa and First Steps 动态规划

C题现在真的做不来，还是先从AB做起，多刷几题再说把
主要就是用空间换时间，dp[i]表示i之前的最后一个递增序列长度

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while (in.hasNextInt()) {
			int n = in.nextInt(), ans = 0;
			int[] a = new int[n];
			int[] dp = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = in.nextInt();
			}
			for (int i = 0; i < n-1; i++) {
				dp[i+1] = a[i] <= a[i+1] ? dp[i]+1 : 0;
				ans = Math.max(ans, dp[i+1]);
			}
			System.out.println(ans+1);
		}
	}
}