Submission
Status:
[PP-SSSSSSSSSS]
Subtask/Task Score:
{0/100}
Score: 0
User: Seng
Problemset: ซื้อขายหุ้นซีเค
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-07 10:38:50
#include <bits/stdc++.h>
using namespace std;
int p[100005];
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int n;cin >> n;
int mx = 0;
for(int i = 1; i <= n; i++){
cin >> p[i];
}
for(int i = 1; i < n; i++){
for(int j = i+1; j <= n; j++){
if(p[j]<p[i]) continue;
mx = max(mx, p[j]-p[i]);
}
}
cout << mx;
return 0;
}