3072. 小巴菲特买股票

题意好像说的不太明白，看AC代码好像只能买一次和卖一次

直接模拟，不需要数组，只能买一次，卖一次

include

using namespace std;

define INF 0x3f3f3f3f

int T,n;

void solve()
{
cin>>n;
int ans=0;

int MIN=INF;
for(int i=1;i<=n;i++)
{
int now;cin>>now;
ans=max(ans,now-MIN);
MIN=min(MIN,now);
}
cout<<ans<<endl;
return;
}
int main()
{
scanf(“%d”,&T);
for(int step=0;step<T;step++)
{
printf(“case #%d:\n”,step);
solve();
}
return 0;
}

数据集太弱,暴力也可以过,不过还是dp最快

T = int(input())
for N in range(T):
    n = int(input())
    L = [int(i) for i in input().split()]
    max = 0; temp = 0
    for i in range(1, n):
        a = L[i]-L[i-1]
        if temp > 0:
            temp += a
        else:
            temp = a
        if temp > max:
            max = temp
    print("case #%d:"%N)
    print(max)