public static void main(String []args)
{
int a[] = {1,13,10,2,5,9,15,20,8};
int result[] = new int[a.length];
result[0] = a[0];
int max = 0;
int index = 0;
for(int i=0; i<a.length; i++)
{
max = 0;
for(int j=0;j<i-1;j++)
{
if(result[j] > max)
max = result[j];
}
result[i] = max + a[i];
}
for(int i=1; i<result.length; i++)
{
if(result[i] > max)
max = result[i];
}
System.out.println(max);
}
}
Sunday, August 19, 2012
Largest Non-Consecutive Sum
Labels:
Dynamic Programming
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment