Submission
Status:
[P-SSSSSSSSSSS]
Subtask/Task Score:
{0/100}
Score: 0
User: kimza
Problemset: ซื้อขายหุ้นซีเค
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-09 22:33:58
#include <bits/stdc++.h>
#define int long long
const int N = 1e9;
using namespace std;
int32_t main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> v;
for(int i=0;i<n;i++){
int a;
cin >> a;
v.push_back(a);
}
int min = N;
int max = 0;
for(int i=1;i<n;i++){
if(v[i]>v[i-1]){
if(v[i] > max) max = v[i];
}
if(v[i]<=v[i-1]){
if(v[i] < min) min = v[i];
}
}
cout << max-min;
return 0;
}