Submission

Score: 0

User: anonymous

Problemset: stock

Language: cpp

Time: 1.096 second

Submitted On: 2026-10-03 15:57:07

#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	long long m[100005],anw = 0;
	
	for(int i=0;i<n;i++)
	{
		cin >> m[i];
	}
	
	for(int i=n-1;i >= 0;i--)
	{
		for(int j=i-1;j>=0;j--)
		{
			anw = max(m[i] - m[j] , anw);
		}
	}
	cout << anw;
}