Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Kadane's Algorithm
//'main' method must be in a class 'Rextester'. //openjdk version '11.0.5' import java.io.*; import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] arr = new int[n]; StringTokenizer st = new StringTokenizer(br.readLine()); for(int i=0;i<n;i++){ //if(st.hasMoreToken()) arr[i] = Integer.parseInt(st.nextToken()); } int msf=0;//max_so_far int meh=0;//mx_ending_here for(int val:arr){ meh+=val; if(meh>msf) msf = meh; if(meh<0) meh = 0; } System.out.println(msf); } }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
post decrement
Menu Combination Sum
練習3-6
Main.java
String Palindrome
mp1
[a-zA-Z ]{0,12}
bookstore
S
ABC`s
stackse - search stackoverflow differently
Please log in to post a comment.