Submission #1248944

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <climits>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
#include <numeric>
#include <set>
#include <map>
#include <list>
#include <bitset>
#define debug(x) cout << #x << ": " << (x) << endl
using namespace std;

const double PI  = 3.141592653589793238463;
const int INF = 1000000007;

using ull = unsigned long long;
using ll = long long;

using Int = int;
using Double = double;

using P = pair<Int, Int>;
using V = vector<Int>;
using M = vector<V>;

Int solve(Int n, Int t, V& as){
    Int ans = 0;
    Int max_a = 0;
    Int min_a = INT_MAX;
    for(int i = 0; i < n; i++){
        min_a = min(min_a, as[i]);
        if(as[i] - min_a > max_a){
            max_a = as[i] - min_a;
            ans = 1;
        }else if(as[i] - min_a == max_a){
            ans++;
        }
    }
    return ans;
}


int main(int argc, char* argv[]){
    cin.tie(0);
    ios::sync_with_stdio(false);

    Int n, t;
    cin >> n >> t;
    V as(n);
    for(int i = 0; i < n; i++){
        cin >> as[i];
    }

    cout << solve(n, t, as) << "\n";

    return 0;
}

Submission Info

Judge Result