Submission #970893


Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
	int n,t;	cin>>n>>t;
	vector<int> a(n);
	for(int i=0;i<n;i++)	cin>>a[i];
	int profit=0,sml=a[0],pattern=0;
	for(int i=1;i<n;i++){
		if(sml>a[i]){
			sml=a[i];
		}
		else if(a[i]-sml>profit){
			profit=a[i]-sml;
			pattern=1;
		}
		else if(a[i]-sml==profit){
			pattern++;
		}
	}
	cout<<pattern<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - An Invisible Hand
User fiord
Language C++14 (GCC 5.4.1)
Score 400
Code Size 431 Byte
Status AC
Exec Time 42 ms
Memory 640 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 12
Set Name Test Cases
sample sample_01.txt, sample_02.txt, sample_03.txt
All large_01.txt, large_02.txt, random_01.txt, random_02.txt, small_01.txt, small_02.txt, spec_01.txt, spec_02.txt, spec_03.txt, spec_04.txt, spec_05.txt, spec_06.txt
Case Name Status Exec Time Memory
large_01.txt AC 42 ms 640 KB
large_02.txt AC 30 ms 640 KB
random_01.txt AC 42 ms 640 KB
random_02.txt AC 42 ms 640 KB
sample_01.txt AC 3 ms 256 KB
sample_02.txt AC 3 ms 256 KB
sample_03.txt AC 3 ms 256 KB
small_01.txt AC 3 ms 256 KB
small_02.txt AC 2 ms 256 KB
spec_01.txt AC 42 ms 640 KB
spec_02.txt AC 42 ms 640 KB
spec_03.txt AC 42 ms 640 KB
spec_04.txt AC 42 ms 640 KB
spec_05.txt AC 42 ms 640 KB
spec_06.txt AC 42 ms 640 KB