Competitive coding

[Anonymous7991]

Given a matrix B of k x j integers representing the predicted prices of m shares for n days and an integer x (positive), find a sequence of at most c transactions that result in maximum profit. (you can hold only one share at a time and you can buy and sell on the same day).
Given an algorithm of time o(m*(n^2k)).

 

[WhiteCube]

Given a matrix B of k x j integers representing the predicted prices of m shares for n days and an integer x (positive), find a sequence of at most c transactions that result in maximum profit. (you can hold only one share at a time and you can buy and sell on the same day).
Given an algorithm of time o(m*(n^2k)).

projecteuler.net has hundreds of interesting programming problems in their archive.

The key word is "interesting".