蓝桥杯--最大化股票交易的利润

https://www.lanqiao.cn/problems/307/learning/?contest_id=55

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 
 4 int main()
 5 {
 6   int i,j,N;
 7   scanf("%d",&N);
 8   int a[N+1];
 9   for(i=1;i<=N;i++){
10     scanf("%d",&a[i]);
11   }
12   int max=-10000;
13   for(i=1;i<=N;i++){
14     for(j=i+1;j<=N;j++){
15         if(max<a[j]-a[i])max=a[j]-a[i];
16     }
17   }
18   printf("%d",max);
19 
20 }

标签：最大化,www,main,cn,--,蓝桥,int,include
来源： https://www.cnblogs.com/hzzzz/p/16074032.html