Submission #23865

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<complex>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<cstring>
using namespace std;

#define REP(i, x, n) for(int i = x ; i < (int)(n) ; i++)
#define rep(i, n)    REP(i, 0, n)
#define f first
#define s second
#define mp make_pair
#define pb push_back

const int INF = (1<<29);
const double EPS = 1e-9;
const int dx[] = {1,-1,0,0};
const int dy[] = {0,0,1,-1};

int d[500];
int maxi, mini;



int main(){
   int n;
   cin >> n;
   rep(i,n)cin >> d[i];

   maxi = 0;
   mini = INF;

   //max
   rep(i,n)maxi += d[i];

   //min
   int sum[501];
   sum[0] = 0;
   REP(i,1,n+1)sum[i] = sum[i-1] + d[i-1];
   
   if(n==1)mini = maxi;
   else if(n==2)mini = abs(d[0]-d[1]);
   else{
      REP(j,0,n){
	 REP(k,j+1,n+1){
	    int a = sum[j];
	    int b = sum[k] - sum[j];
	    int c = sum[n] - sum[k];
	    //cout << a << "  " << b <<" " << c << endl;
	    if(a+c >= b && a+b >= c && b+c >= a)mini = 0;
	    else mini = min(mini, abs(abs(a-b)-c));
	 }
      }
   }
   
   cout << maxi << endl;
   cout << mini << endl;

   return 0;
}

Submission Info

Judge Result