void problem(int n){
switch(n){
case 123:{
//int a[] = {-2 , 1 , -3 , 4 , -1 , 2 , 1 , -5 , 4};
int a[] = {1 , 2 , 3 , 0 , 2};
int len = sizeof(a) / sizeof(int);
vector<int> in(a , a + len);
cout << maxProfit2(in) << endl;
}
break;
case 121:{
//int a[] = {-2 , 1 , -3 , 4 , -1 , 2 , 1 , -5 , 4};
int a[] = {1 , 2 , 3 , 0 , 2};
int len = sizeof(a) / sizeof(int);
vector<int> in(a , a + len);
cout << maxProfit(in) << endl;
}
break;
case 279:{
cout << numSquares(12) << endl;
cout << numSquares(13) << endl;
}
break;
case 309:{
//int a[] = {-2 , 1 , -3 , 4 , -1 , 2 , 1 , -5 , 4};
int a[] = {1 , 2 , 3 , 0 , 2};
int len = sizeof(a) / sizeof(int);
vector<int> in(a , a + len);
cout << maxProfit_cooldown(in) << endl;
}
break;
case 343:{
cout << integerBreak(5) << endl;
cout << integerBreak(10) << endl;
}
break;
case 338:{
showVector(countBits(5));
showVector(countBits(15));
}
break;
case 70:{
cout << climbStairs(5) << endl;
cout << climbStairs(15) << endl;
cout << climbStairs(8) << endl;
}
break;
case 53:{
//int a[] = {-2 , 1 , -3 , 4 , -1 , 2 , 1 , -5 , 4};
int a[] = {-2 , -1 , -3};
int len = sizeof(a) / sizeof(int);
vector<int> in(a , a + len);
cout << maxSubArray(in) << endl;
}
break;
default:
break;
}
}
int main(int argc, char **argv)
{
int i, count = argc - 1;
int *nums = malloc(count * sizeof(int));
for (i = 0; i < count; i++) {
nums[i] = atoi(argv[i + 1]);
}
printf("%d\n", maxProfit(nums, count));
return 0;
}
int main(int argc, char* argv[]){
uint32_t number =10;
int stock[10]= {890,322,70,42,34,25,23,17,11,0};
printf("number = %d\n", number);
maxProfit(stock,10);
return 0;
}
int main(int argc, char const *argv[])
{
vector<int> prices = {6,1,3,2,4,7};
for (std::vector<int>::iterator i = prices.begin(); i != prices.end(); ++i)
{
cout<<*i<<", ";
}
cout<<endl;
cout<<maxProfit(prices)<<endl;
return 0;
}
int main()
{
vector<int> prices;
prices.push_back(1);
prices.push_back(3);
prices.push_back(4);
prices.push_back(5);
prices.push_back(6);
prices.push_back(8);
int m = maxProfit(2, prices);
std::cout<< m;
}
int main(int argc, const char *argv[])
{
//int data[10] = {};
int ans;
//int data[] = {1,2,4,2,5,7,2,4,9,0},k=2, length = 10;//13, 7 - 1 9 - 2
//int data[] = {0,8,5,7,4,7},length = 6,k=2;
int k = 29,length = 1000, data[] = {70,4,83,56,94,72,78,43,2,86,65,100,94,56,41,66,3,33,10,3,45,94,15,12,78,60,58,0,58,15,21,7,11,41,12,96,83,77,47,62,27,19,40,63,30,4,77,52,17,57,21,66,63,29,51,40,37,6,44,42,92,16,64,33,31,51,36,0,29,95,92,35,66,91,19,21,100,95,40,61,15,83,31,55,59,84,21,99,45,64,90,25,40,6,41,5,25,52,59,61,51,37,92,90,20,20,96,66,79,28,83,60,91,30,52,55,1,99,8,68,14,84,59,5,34,93,25,10,93,21,35,66,88,20,97,25,63,80,20,86,33,53,43,86,53,55,61,77,9,2,56,78,43,19,68,69,49,1,6,5,82,46,24,33,85,24,56,51,45,100,94,26,15,33,35,59,25,65,32,26,93,73,0,40,92,56,76,18,2,45,64,66,64,39,77,1,55,90,10,27,85,40,95,78,39,40,62,30,12,57,84,95,86,57,41,52,77,17,9,15,33,17,68,63,59,40,5,63,30,86,57,5,55,47,0,92,95,100,25,79,84,93,83,93,18,20,32,63,65,56,68,7,31,100,88,93,11,43,20,13,54,34,29,90,50,24,13,44,89,57,65,95,58,32,67,38,2,41,4,63,56,88,39,57,10,1,97,98,25,45,96,35,22,0,37,74,98,14,37,77,54,40,17,9,28,83,13,92,3,8,60,52,64,8,87,77,96,70,61,3,96,83,56,5,99,81,94,3,38,91,55,83,15,30,39,54,79,55,86,85,32,27,20,74,91,99,100,46,69,77,34,97,0,50,51,21,12,3,84,84,48,69,94,28,64,36,70,34,70,11,89,58,6,90,86,4,97,63,10,37,48,68,30,29,53,4,91,7,56,63,22,93,69,93,1,85,11,20,41,36,66,67,57,76,85,37,80,99,63,23,71,11,73,41,48,54,61,49,91,97,60,38,99,8,17,2,5,56,3,69,90,62,75,76,55,71,83,34,2,36,56,40,15,62,39,78,7,37,58,22,64,59,80,16,2,34,83,43,40,39,38,35,89,72,56,77,78,14,45,0,57,32,82,93,96,3,51,27,36,38,1,19,66,98,93,91,18,95,93,39,12,40,73,100,17,72,93,25,35,45,91,78,13,97,56,40,69,86,69,99,4,36,36,82,35,52,12,46,74,57,65,91,51,41,42,17,78,49,75,9,23,65,44,47,93,84,70,19,
22,57,27,84,57,85,2,61,17,90,34,49,74,64,46,61,0,28,57,78,75,31,27,24,10,93,34,19,75,53,17,26,2,41,89,79,37,14,93,55,74,11,77,60,61,2,68,0,15,12,47,12,48,57,73,17,18,11,83,38,5,36,53,94,40,48,81,53,32,53,12,21,90,100,32,29,94,92,83,80,36,73,59,61,43,100,36,71,89,9,24,56,7,48,34,58,0,43,34,18,1,29,97,70,92,88,0,48,51,53,0,50,21,91,23,34,49,19,17,9,23,43,87,72,39,17,17,97,14,29,4,10,84,10,33,100,86,43,20,22,58,90,70,48,23,75,4,66,97,95,1,80,24,43,97,15,38,53,55,86,63,40,7,26,60,95,12,98,15,95,71,86,46,33,68,32,86,89,18,88,97,32,42,5,57,13,1,23,34,37,13,65,13,47,55,85,37,57,14,89,94,57,13,6,98,47,52,51,19,99,42,1,19,74,60,8,48,28,65,6,12,57,49,27,95,1,2,10,25,49,68,57,32,99,24,19,25,32,89,88,73,96,57,14,65,34,8,82,9,94,91,19,53,61,70,54,4,66,26,
8,63,62,9,20,42,17,52,97,51,53,19,48,76,40,80,6,1,89,52,70,38,95,62,24,88,64,42,61,6,50,91,87,69,13,58,43,98,19,94,65,56,72,20,72,92,85,58,46,67,2,23,88,58,25,88,18,92,46,15,18,37,9,90,2,38,0,16,86,44,69,71,70,30,38,17,69,69,80,73,79,56,17,95,12,37,43,5,5,6,42,16,44,22,62,37,86,8,51,73,46,44,15,98,54,22,47,28,11,75,52,49,38,84,55,3,69,100,54,66,6,23,98,22,99,21,74,75,33,67,8,80,90,23,46,93,69,85,46,87,76,93,38,77,37,72,35,3,82,11,67,46,53,29,60,33,12,62,23,27,72,35,63,68,14,35,27,98,94,65,3,13,48,83,27,84,86,49,31,63,40,12,34,79,61,47,29,33,52,100,85,38,24,1,16,62,89,36,74,9,49,62,89
};
ans = maxProfit(k,data,length);
printf("%d\n", ans);
return 0;
}
int main(void)
{
int Input[] = {7,1,5,3,6,4};
//int Input[] = {1,7,1};
int Input_size = sizeof(Input)/sizeof(int);
printf("The input is:\n");
printArray(Input, Input_size);
int max_profit = maxProfit(Input, Input_size);
printf("The max profit is:%d\n", max_profit);
return 0;
}
int maxProfit(int k, vector<int>& prices) {
if (k >= prices.size()) {
return maxProfit(prices);
}
vector<int> global(k + 1, 0);
vector<int> local(k + 1, 0);
for (size_t i = 1; i < prices.size(); ++ i) {
int diff = prices[i] - prices[i - 1];
for (int j = k; j >= 1; -- j) {
local[j] = max(global[j - 1] + max(diff, 0), local[j] + diff);
global[j] = max(global[j], local[j]);
}
}
return global[k];
}
int maxProfit(int k, vector<int>& prices) {
int n = prices.size();
if (k >= n) return maxProfit(prices);
vector<int> global(n, 0);
vector<int> local(n, 0);
for (int j = 0; j < k; j++) {
for (int i = 1; i < n; i++) {
int profit = prices[i] - prices[i - 1];
local[i] = max(local[i - 1] + profit, global[i - 1] + profit);
}
for (int i = 1; i < n; i++) {
global[i] = max(global[i - 1], local[i]);
}
}
return global[n - 1];
}
int main(int argc, char** argv) {
struct timeval tvStart, tvEnd;
int profit;
gettimeofday(&tvStart, NULL);
profit = maxProfit(PRICES_K, PRICES, PRICES_SIZE);
gettimeofday(&tvEnd, NULL);
int ds = tvEnd.tv_sec - tvStart.tv_sec;
int dus = tvEnd.tv_usec - tvStart.tv_usec;
if (dus < 0) {
ds--;
dus += 1000000;
}
printf("maxProfit(%d, size %d): time %d.%06d seconds, max %d profit\n",
PRICES_K, PRICES_SIZE, ds, dus, profit);
return 0;
}
int findMaxCapital(int k, int w, const std::vector<int>& p, const std::vector<int>& c) {
MinHeap minCost(cmp1);
MaxHeap maxProfit(cmp2);
for (int i = 0; i < p.size(); ++i) {
minCost.push(Node(p[i], c[i]));
}
for (int i = 0; i < k; ++i) {
while (!minCost.empty() && minCost.top().c <= w) {
maxProfit.push(minCost.top());
minCost.pop();
}
if (maxProfit.empty())
return w;
w += maxProfit.top().p;
maxProfit.pop();
}
return w;
}
/**
* @param k: An integer
* @param prices: Given an integer array
* @return: Maximum profit
*/
int maxProfit(int k, vector<int> &prices) {
// write your code here
if (0 == prices.size()) {
return 0;
}
else if (k >= prices.size()) {
return maxProfit(prices);
}
vector<int> local(k + 1, 0);
vector<int> global(k + 1, 0);
for (size_t i = 0; i + 1 < prices.size(); ++ i) {
int diff = prices[i + 1] - prices[i];
for (int j = k; j >= 1; -- j) {
local[j] = max(global[j - 1] + max(diff, 0), local[j] + diff);
global[j] = max(global[j], local[j]);
}
}
return global[k];
}
static void normal3(void **state) {
(void) state; /* unused */
int stock[] = {3, 2, 1, 3};
assert_int_equal(maxProfit(stock, 4), 2);
}
int main(void)
{
int x[] = { 3, 2, 6, 5, 0, 3 };
printf("%d\n", maxProfit(x, sizeof(x) / sizeof(x[0])));
return(0);
}
int main() {
int prices[5] = {1,5,3,9,2};
assert(maxProfit(prices, 5) == 10);
return 0;
}
int main() {
int nums[5] = {1,2,3,0,2};
assert(maxProfit(nums, 5) == 3);
return 0;
}
/* A test case that with empty input. */
static void empty(void **state) {
(void) state; /* unused */
int stock[] = {};
assert_int_equal(maxProfit(stock, 0), 0);
}
int main() {
int a[] = {1,4,2};
vector<int> b = arrayToVector(a);
cout<<maxProfit(b)<<endl;
return 0;
}
int main()
{
int a[] = {2, 1, 2, 0, 1};
printf("%d\n", maxProfit(a, 5));
return 0;
}
static void normal1(void **state) {
(void) state; /* unused */
int stock[] = {1, 2, 3};
assert_int_equal(maxProfit(stock, 3), 2);
}
static void normal2(void **state) {
(void) state; /* unused */
int stock[] = {3, 2, 1};
assert_int_equal(maxProfit(stock, 3), 0);
}
void Main()
{
vector<int> input = createVector({2, 1, 2, 0, 1});
print(maxProfit(input));
}
int main() {
int prices[] = {1, 2, 3, 2, 4};
printf("%d\n", maxProfit(prices, sizeof(prices)/sizeof(prices[0])));
return 0;
}