package com.wyq.coder; import java.util.HashMap; import java.util.Scanner; public class Solution { public static void main(String args[]){ //int a[] = new int[]{1,2,3,-1,-2,-3,1,-4,1,2}; Scanner scan = new Scanner(System.in); String[] b = scan.nextLine().trim().split(" "); int c[] = new int[b.length]; for(int i=0;i<b.length;i++){ c[i] = Integer.valueOf(b[i]); } getMax(c); } public static void getMax(int[] a){ int left = 0;//起点 int right = 0;//结束位置 int len = -1;//初始长度 for(int i=0;i<a.length-1;i++){ int sum=a[i]; if(sum==0&&(len<0)){ left = i; right = i; len = 0; } for(int j=i+1;j<a.length;j++){ sum+=a[j]; if(sum==0&&(len<j-i)){ left = i; right = j; len = right - left; } } } for(int k=left;k<=right;k++){ System.out.print(a[k]+" "); } } }