動態規劃最大子序列之hd1003

#include<iostream> #include<cstdio> using namespace std; int main() { int t,n,a,cot=1; scanf("%d",&t); while(t--) { scanf("%d",&n); int i,temp=1,ans=0,f=0,l,maxsum=-100

>>阅读原文<<