Submission #23305

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;

#define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i < (c).end(); i++)
#define push_back pb
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)

int main(int argc, char *argv[]) {
  int N;
  cin >> N;
  int d;
  int i;

  int max_dist;
  int min_dist;

  cin >> d;
  max_dist = min_dist = d;

  REP(1, N, i) {
    cin >> d;
    if(d < min_dist) {
      min_dist = min_dist - d;
    }
    else if(d <= max_dist) {
      min_dist = 0;
    }
    else {
      min_dist = d - max_dist;
    }

    max_dist += d;
  }

  cout << max_dist << endl << min_dist << endl;

  return 0;
}

Submission Info

Judge Result