F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_28845270_8825\Main.java:1: 错误: 解析时已到达文件结尾
import java.util.Scanner; public class 杭电1003dp { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int t=sc.nextInt(); int c[][]=new int [t][3]; for(int q=0;q<t;q++) { int n=sc.nextInt();//n个整数 int a[]=new int[n]; int dp[]=new int[n+100];//以第i个元素结尾的最大 int start=0,valuestart=0; int end=0,valuend=0; for(int i=0;i<n;i++) { a[i]=sc.nextInt(); } dp[0]=a[0]; int dpmax=a[0]; for(int i=1;i<n;i++) { end=i; dp[i]=max(a[i],dp[i-1]+a[i]); if(a[i]>dp[i-1]+a[i]) {start=i;} if(dp[i]>dpmax) {valuestart=start;valuend=end;dpmax=dp[i];}//一定要有等于号 } c[q][0]=dpmax; c[q][1]=1+valuestart; c[q][2]=valuend+1; } for(int i=0;i<t;i++) { System.out.println("Case"+" "+(i+1)+":"); System.out.println(c[i][0]+" "+c[i][1]+" "+c[i][2]); if(i!=t-1) System.out.println(); } } private static int max(int i, int j) { return i>j?i:j; } }
                                                                                                                                                                                                                      ^
0_0_28845270_8825\Main.java:2: 错误: 解析时已到达文件结尾
2 个错误


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-10-06 04:19:21, Gzip enabled