题目:http://acm.pku.edu.cn/JudgeOnline/problem?id=2452
思路:搜索。注意,这题使用BufferedRead会WA,推荐使用Scanner。(估计测试数据有问题)
- import java.io.BufferedInputStream;
- import java.io.IOException;
- import java.util.Scanner;
- public class Main {
- public static void main(String[] args) throws IOException {
- Scanner read = new Scanner(new BufferedInputStream(System.in));
- int n;
- int[] t;
- int i, j;
- int max;
- while (read.hasNextInt()) {
- n = read.nextInt();
- t = new int[n];
- for (i = 0; i < n; i++) {
- t[i] = read.nextInt();
- }
- max = 0;
- for (i = 0; i < n;) {
- j = i;
- for (int k = i + 1; k < n; k++) {
- if (t[k] < t[i]) {
- break;
- }
- if (t[k] > t[j]) {
- j = k;
- }
- }
- if (j - i > max) {
- max = j - i;
- }
- if (max < j - i) {
- max = j - i;
- }
- i = j + 1;
- }
- if (max == 0) {
- max = -1;
- }
- System.out.println(max);
- }
- }
- }