HackerRank - Stock Maximize

题目：https://www.hackerrank.com/challenges/stockmax

Your algorithms have become so good at predicting the market that you now know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for the next N days.

Each day, you can either buy one share of WOT, sell any number of shares of WOT that you own, or not make any transaction at all. What is the maximum profit you can obtain with an optimum trading strategy?

Input

The first line contains the number of test cases T. T test cases follow:

The first line of each test case contains a number N. The next line contains N integers, denoting the predicted price of WOT shares for the next N days.

Output

Output T lines, containing the maximum profit which can be obtained for the corresponding test case.

Constraints

1 <= T <= 10
1 <= N <= 50000

All share prices are between 1 and 100000

Sample Input

Sample Output

0
197
3

Explanation

For the first case, you cannot obtain any profit because the share price never rises.
For the second case, you can buy one share on the first two days, and sell both of them on the third day.
For the third case, you can buy one share on day 1, sell one on day 2, buy one share on day 3, and sell one share on day 4.

分析：

动态规划的思想，从后往前处理，如果后面的最大值大于当前值，则将差值加到结果上，否则更新最大值。

代码：

#include <iostream>
#include <vector>int main() {int T;std::cin >> T;int N;while(T--) {std::cin >> N;std::vector<int> nums(N, 0);for(int i = 0; i < N; ++i) {std::cin >> nums[i];}long long result = 0;  // !int max = nums[N - 1];for(int i = N - 2; i >= 0; --i) {if(max > nums[i]) {result += (max - nums[i]);} else {max = nums[i];}}std::cout << result << std::endl;}return 0;
}

HackerRank - Stock Maximize相关推荐

Introduction to Financial Management
Recently,i am learning some useful things about financial management by reading <Essentials of Co ...
Stock Market（luogu 2938）
题目描述 Despite their innate prudence, the cows took a beating in the home mortgage market and now are ...
【Column Generation思考-02】|从对偶的角度理解Cutting Stock Problem【更新版本】
[Column Generation思考-01]|从对偶的角度理解 Cutting Stock Problem简介 Cutting Stock Problem的Column generation re ...
121. Best Time to Buy and Sell Stock买卖股票的最佳时机
You are given an array prices where prices[i] is the price of a given stock on the ith day. 给定一个数组 p ...
【73套】Epic Stock Media配乐音效素材合集包
[73套]Epic Stock Media配乐音效素材合集包大小:114G丨WAV Epic Stock Media 系列音效合辑包含了战争电影音效.史诗梦幻音效.日常生活音效.森林环境音效.电影 ...
[Swift]LeetCode901. 股票价格跨度 | Online Stock Span
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
Best Time to Buy and Sell Stock II
题目: Say you have an array for which the i th element is the price of a given stock on day i. Design ...
121-Best Time to Buy and Sell Stock
题目: Say you have an array for which the ith element is the price of a given stock on day i. If you w ...
1578: [Usaco2009 Feb]Stock Market 股票市场
1578: [Usaco2009 Feb]Stock Market 股票市场 Time Limit: 10 Sec Memory Limit: 64 MB Submit: 414 Solved: ...
大宗商品(Bulk Stock)交易
大宗商品(Bulk Stock) 是指可进入流通领域,但非零售环节,具有商品属性用于工农业生产与消费使用的大批量买卖的物质商品.在金融投资市场,大宗商品指同质化. 可交易. 被广泛作为工业基础原材料的 ...

HackerRank - Stock Maximize

HackerRank - Stock Maximize相关推荐

最新文章

热门文章