The Java Program: Maximum.java

  1 // Maximum.java:  Maximum sum subsequence (sequential version)
  2 
  3 class Maximum {
  4    static int X [] = { -4, 2, 6, -1, -7, 4, 2, -1 };
  5    static int u,v=0;
  6    
  7    public static void main (String args[]) {
  8       int seen=X[0],here=X[0];
  9       int q = 0;
 10       for (int i=1; i<X.length; i++) {
 11          if (here>=0) {
 12             here = here + X[i];
 13          } else {
 14             here = X[i];
 15             q = i;
 16          }
 17          if (seen<here) {
 18             seen = here;
 19             u = q;
 20             v = i;
 21          }
 22       }
 23       System.out.println ("u="+u+", v="+v+", max="+seen);
 24    }
 25 }