Submission #1234583

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i < int(e); i++)
#define FORIT(i,c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ISEQ(c) (c).begin(), (c).end()

int main(){
	int N,T;
	cin >> N >> T;
	int A[N];
	FOR(i,0,N) cin >> A[i];
	int maxA[N];
	int max = A[N-1];
	for (int i = N-1; i >= 0;i--){
		if (A[i] > max) max = A[i];
		maxA[i] = max;
	}
	int merit[N];
	merit[N-1] = 0;
	max = 0;
	FOR(i,0,N-1){
		merit[i] = maxA[i+1] - A[i];
		if (max < merit[i]) max = merit[i];
	}
	int ret = 0;
	FOR(i,0,N-1){
		if (merit[i] == max) ret++;
	}
	cout << ret << endl;

	return 0;
}

Submission Info

Judge Result