HackerRank# Stock Maximize

原题地址

不知道为什么要用动态规划做，明明是扫几遍就行了啊

HackerRank上的题目特别喜欢long long类型啊，不用就爆。。

代码：

 #include <cmath>
 #include <cstdio>
 #include <vector>
 #include <iostream>
 #include <algorithm>
 using namespace std;

 #define MAX_N 50008

 long long share[MAX_N];
 bool sell[MAX_N];

 int main() {
     /* Enter your code here. Read input from STDIN. Print output to STDOUT */
     int T, N;
     cin >> T;
     while (T--) {
         long long max_share = ;
         long long profit = ;
         long long cnt = ;
         cin >> N;
         for (int i = ; i < N; i++)
             cin >> share[i];
         max_share = share[N - ];
         for (int i = N - ; i >= ; i--) {
             sell[i] = share[i] >= max_share;
             max_share = max(max_share, share[i]);
         }
         for (int i = ; i < N; i++) {
             if (sell[i]) {
                 profit += cnt * share[i];
                 cnt = ;
             } else {
                 profit -= share[i];
                 cnt += ;
             }
         }
         cout << profit << endl;
     }
     return ;
 }