Best Time to Buy and Sell Stock
123456789101112131415161718192021222324252627282930313233
#include <iostream>
using namespace std;
int maxSum(int A[], int n){
int min = 0;
int c=0;
for(int i=0; i<n-1; i++){
for(int j= i+1; j<n; j++){
if(A[j]-A[i]>0 && A[j]-A[i]>min){
min = A[j]- A[i];
c++;
}
}
}
if(c==0){
return 0;
}
return min;
}
int main() {
int n ;
cin>>n;
int A[n];
for(int i =0; i<n; i++){
cin>>A[i];
}
cout<<maxSum(A,n);
}
Cpp
INFO