fork download
  1. program anchovies;
  2. Uses Math;
  3. var N, i, prezzominimo, prezzoacquisto, maxprofitto : Longint;
  4. P : array[1..100000] of Longint;
  5.  
  6. begin
  7. readln(N);
  8. for i:=1 to N do readln(P[i]);
  9. prezzominimo:=P[1];
  10. maxprofitto:=0;
  11. for i:=2 to N do
  12. begin
  13. if P[i]<prezzominimo then prezzominimo:= P[i]
  14. else
  15. if P[i]>prezzominimo then
  16. begin
  17. prezzoacquisto:=prezzominimo;
  18. maxprofitto:=max(maxprofitto, P[i]-prezzoacquisto);
  19. end;
  20. end;
  21. writeln(maxprofitto);
  22. end.
Success #stdin #stdout 0s 5324KB
stdin
7
9
3
7
5
8
6
1
stdout
5