nyoj-字和串之差

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int dp[1000010];int main(){int ncase;int num, temp;int max1, min1;scanf("%d", &ncase);while(ncase--){memset(dp, 0, sizeof(dp));scanf("%d", &num);dp[0] = 0;for(int i = 1; i <= num; ++i){scanf("%d", &temp);dp[i] = dp[i - 1] + temp;}sort(dp, dp + num + 1);max1 = dp[num] - dp[0];cout<<max1<<endl;min1 = 99999;for(int i = 0; i < num; ++i)min1 = min(min1, dp[i + 1] - dp[i]);printf("%d\n", max1 - min1);}return 0;}