jw910731

麗山校內賽PE參考解

Jun 12th, 2019
171
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.53 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define MAX 5000
  4. int dp[MAX+5];
  5. int main(){
  6.     int T;
  7.     scanf("%d",&T);
  8.     while(T--){
  9.         memset(dp,0x00,sizeof(dp));
  10.         int n;
  11.         scanf("%d",&n);
  12.         for(int i=0;i<n;i++){
  13.             int tmp;
  14.             scanf("%d",&tmp);
  15.             dp[i] = min(tmp+( (i>0)? dp[i-1] : 0 ),0);
  16.         }
  17.         int minium = 0;
  18.         for(int i=0;i<n;i++){
  19.             minium = min(minium, dp[i]);
  20.         }
  21.         printf("%d\n",minium);
  22.     }
  23.     return 0;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment