topcoder/BadNeighbors.cpp at master · cou929/topcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
// BEGIN CUT HERE
// END CUT HERE
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
using namespace std;
class BadNeighbors {
  int r(vector <int> donations)
  {
    int maxDonates[41][2];

    for (int i=0; i<donations.size(); i++)
      {
	maxDonates[i][0] = donations[i];
	maxDonates[i][1] = 0;

	for (int j=0; j<i; j++)
	  {
	    if (i-j == 1)
	      {
		maxDonates[i][0] = max(maxDonates[i][0], maxDonates[j][1] + donations[i]);
		maxDonates[i][1] = max(maxDonates[i][1], max(maxDonates[j][0], maxDonates[j][1]));
	      }
	    else
	      {
		maxDonates[i][0] = max(maxDonates[i][0], max(maxDonates[j][0] + donations[i], maxDonates[j][1] + donations[i]));
		maxDonates[i][1] = max(maxDonates[i][1], max(maxDonates[j][0], maxDonates[j][1]));
	      }
	  }
      }

    return max(maxDonates[donations.size()-1][0], maxDonates[donations.size()-1][1]);
  }

public:
  int maxDonations(vector <int> donations)
  {
    vector <int> tmp1 = donations;
    tmp1.erase(tmp1.begin());
    vector <int> tmp2 = donations;
    tmp2.erase(tmp2.end()-1);

    return max(r(tmp1), r(tmp2));
  }

  // BEGIN CUT HERE
public:
  void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
private:
  template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
  void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
  void test_case_0() { int Arr0[] =  { 10, 3, 2, 5, 7, 8 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 19; verify_case(0, Arg1, maxDonations(Arg0)); }
  void test_case_1() { int Arr0[] = { 11, 15 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 15; verify_case(1, Arg1, maxDonations(Arg0)); }
  void test_case_2() { int Arr0[] = { 7, 7, 7, 7, 7, 7, 7 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 21; verify_case(2, Arg1, maxDonations(Arg0)); }
  void test_case_3() { int Arr0[] = { 1, 2, 3, 4, 5, 1, 2, 3, 4, 5 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 16; verify_case(3, Arg1, maxDonations(Arg0)); }
  void test_case_4() { int Arr0[] = { 94, 40, 49, 65, 21, 21, 106, 80, 92, 81, 679, 4, 61,
				      6, 237, 12, 72, 74, 29, 95, 265, 35, 47, 1, 61, 397,
				      52, 72, 37, 51, 1, 81, 45, 435, 7, 36, 57, 86, 81, 72 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 2926; verify_case(4, Arg1, maxDonations(Arg0)); }

  // END CUT HERE

};
// BEGIN CUT HERE
int main() {
BadNeighbors ___test;
___test.run_test(-1);
}
// END CUT HERE