Aizu ALDS1_1_D Maximum Profit
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main (){
int n,a,b,v,dif,mins;
scanf("%d",&n);
scanf("%d%d",&a,&b);
dif=b-a;
mins=min(a,b);
if(n!=2){
for(int i=2;i<n;i++){
scanf("%d",&v);
if(v-mins>dif){
dif=v-mins;
}
mins=min(v,mins);
}
}
printf("%d\n",dif);
return 0;
}