Submission
Status:
[PPPPTSSSSS]
Subtask/Task Score:
{0/100}
Score: 0
User: faofao
Problemset: stock
Language: cpp
Time: 1.095 second
Submitted On: 2025-10-12 14:37:43
#include <iostream>
#include <string>
using namespace std;
int main(){
int n ; cin >> n;
long long arr[n] ;
long long max ;
for(int i=0 ; i<n ; i++){
cin >> arr[i] ;
max=arr[i] ;
}
for(int i=0 ; i<n ; i++){
for(int j=i+1 ; j<n ; j++){
if(arr[j]-arr[i]>max) max = arr[j]-arr[i] ;
}
}
cout << max ;
return 0;
}