Submission

[PPPPPPPPPP]

Score: 100

User: Test

Problemset: stock

Language: cpp

Time: 0.038 second

Submitted On: 2025-03-26 08:30:52

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n; 

    vector<int> prices(n);
    for (int i = 0; i < n; i++) {
        cin >> prices[i]; 
    }

    int min_price = prices[0];  
    int max_profit = 0;  


    for (int i = 1; i < n; i++) {

        max_profit = max(max_profit, prices[i] - min_price);

        min_price = min(min_price, prices[i]);
    }

    cout << max_profit << endl; 
}

/*
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,mx=0,mn=100000,index_mx=0,index_mn=0;
    cin >> n;
    vector<int> v(n);
    for(int i=0;i<n;i++){
        cin >> v[i];
        if(v[i]<mn){
            mn = v[i];
            index_mn = i;
        }
    }
    //cout << mn << " " << index_mn << endl;
    
    for(int i=index_mn;i<n;i++){
        if(v[i]>mx){
            mx = v[i];
            index_mx = i;
        }
    }
   //cout << mx << " " << index_mx << endl; 
   cout << mx-mn;
}
*/