Algorithmic Puzzle: Continuous Increasing Subsequences(bor0.wordpress.com) |
Algorithmic Puzzle: Continuous Increasing Subsequences(bor0.wordpress.com) |
function f(arr) {
var j=0, ret=0;
for (var i=1; i<=arr.length; i++) {
if (i==arr.length || arr[i]<=arr[i-1]) {
ret += (i-j)*(i-j+1)/2;
j = i;
}
}
return ret;
}