## 2018 年 08 月 27 日 • 阅读: 1207 • 练习 • 阅读设置

• Time Limit: 2000/1000 MS (Java/Others)
• Memory Limit: 65536/65536 K (Java/Others)
• Total Submission(s): 1469
• Accepted Submission(s): 488

### Problem Description

The Power Cube is used as a stash of Exotic Power. There are n cities numbered 1,2,…,n where allowed to trade it. The trading price of the Power Cube in the i-th city is ai dollars per cube. Noswal is a foxy businessman and wants to quietly make a fortune by buying and reselling Power Cubes. To avoid being discovered by the police, Noswal will go to the i-th city and choose exactly one of the following three options on the i-th day:

1. spend ai dollars to buy a Power Cube
2. resell a Power Cube and get ai dollars if he has at least one Power Cube
3. do nothing

Obviously, Noswal can own more than one Power Cubes at the same time. After going to the n cities, he will go back home and stay away from the cops. He wants to know the maximum profit he can earn. In the meanwhile, to lower the risks, he wants to minimize the times of trading (include buy and sell) to get the maximum profit. Noswal is a foxy and successful businessman so you can assume that he has infinity money at the beginning.

### Input

There are multiple test cases. The first line of input contains a positive integer T (T≤250), indicating the number of test cases. For each test case:
The first line has an integer n. ($1≤n≤10^5$)
The second line has n integers a1,a2,…,an where ai means the trading price (buy or sell) of the Power Cube in the i-th city. ($1≤a_i≤10^9$)
It is guaranteed that the sum of all n is no more than $5×10^5$.

### Output

For each case, print one line with two integers —— the maximum profit and the minimum times of trading to get the maximum profit.

### Sample Input

3
4
1 2 10 9
5
9 5 9 10 5
2
2 1

### Sample Output

16 4
5 2
0 0

### Hint

In the first case, he will buy in 1, 2 and resell in 3, 4. profit = - 1 - 2 + 10 + 9 = 16
In the second case, he will buy in 2 and resell in 4. profit = - 5 + 10 = 5
In the third case, he will do nothing and earn nothing. profit = 0

### Source

2018中国大学生程序设计竞赛 - 网络选拔赛

### 题解

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
#include <map>
typedef long long ll;
using namespace std;

int main()
{
int T, n;
ll x, ans1, ans2;
multiset <ll> S;
map <int, int> mp;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
ans1 = ans2 = 0;
S.clear();
mp.clear();
for (int i = 0; i < n; ++i)
{
scanf("%lld", &x);
S.insert(x);
if (*S.begin() < x) // 队首元素小于当前价格
{
ans2++;
if (mp[*S.begin()] > 0) // 如果之前交易过次数减1
{
ans2--;
mp[*S.begin()]--;
}
ans1 += (x - * S.begin()); // 利润
S.erase(S.begin()); // 卖出
S.insert(x); // 再次加入，后面可能还有更高的利润
mp[x]++; // 标记
}
}
printf("%lld %lld\n", ans1, 2 * ans2);
}
return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
typedef long long ll;
using namespace std;

int main()
{
int T, n;
ll x, ans1, ans2;
multiset <pair<ll, int> > S;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
ans1 = ans2 = 0;
S.clear();
for (int i = 0; i < n; ++i)
{
scanf("%lld", &x);
S.insert(make_pair(x, 0)); // 买入状态
S.insert(make_pair(x, 1)); // 卖出状态
ans1 += (x - S.begin()->first);
if (S.begin()->second == 1) // 卖出时操作*2
ans2 += 2;
S.erase(S.begin());
}
printf("%lld %lld\n", ans1, ans2);
}
return 0;
}

The end.
2018-08-27 星期一