0ea7f42c5c 2012-09-02        kinaba: #include <iostream>
0ea7f42c5c 2012-09-02        kinaba: #include <sstream>
0ea7f42c5c 2012-09-02        kinaba: #include <iomanip>
0ea7f42c5c 2012-09-02        kinaba: #include <vector>
0ea7f42c5c 2012-09-02        kinaba: #include <string>
0ea7f42c5c 2012-09-02        kinaba: #include <map>
0ea7f42c5c 2012-09-02        kinaba: #include <set>
0ea7f42c5c 2012-09-02        kinaba: #include <algorithm>
0ea7f42c5c 2012-09-02        kinaba: #include <numeric>
0ea7f42c5c 2012-09-02        kinaba: #include <iterator>
0ea7f42c5c 2012-09-02        kinaba: #include <functional>
0ea7f42c5c 2012-09-02        kinaba: #include <complex>
0ea7f42c5c 2012-09-02        kinaba: #include <queue>
0ea7f42c5c 2012-09-02        kinaba: #include <stack>
0ea7f42c5c 2012-09-02        kinaba: #include <cmath>
0ea7f42c5c 2012-09-02        kinaba: #include <cassert>
0ea7f42c5c 2012-09-02        kinaba: using namespace std;
0ea7f42c5c 2012-09-02        kinaba: typedef long long LL;
0ea7f42c5c 2012-09-02        kinaba: typedef long double LD;
0ea7f42c5c 2012-09-02        kinaba: typedef complex<LD> CMP;
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: class TheBrickTowerMediumDivOne { public:
0ea7f42c5c 2012-09-02        kinaba: 	vector <int> find(vector<int> heights)
0ea7f42c5c 2012-09-02        kinaba: 	{
0ea7f42c5c 2012-09-02        kinaba: 		const int N = heights.size();
0ea7f42c5c 2012-09-02        kinaba: 		const int best = best_for(heights);
0ea7f42c5c 2012-09-02        kinaba: 		vector<bool> used(N, false);
0ea7f42c5c 2012-09-02        kinaba: 		vector<int> answer;
0ea7f42c5c 2012-09-02        kinaba: 		vector<int> current;
0ea7f42c5c 2012-09-02        kinaba: 		int current_score = 0;
0ea7f42c5c 2012-09-02        kinaba: 		for(int i=0; i<N; ++i)
0ea7f42c5c 2012-09-02        kinaba: 		{
0ea7f42c5c 2012-09-02        kinaba: 			for(int k=0; k<N; ++k) if(!used[k])
0ea7f42c5c 2012-09-02        kinaba: 			{
0ea7f42c5c 2012-09-02        kinaba: 				vector<int> hh;
0ea7f42c5c 2012-09-02        kinaba: 				for(int a=0; a<N; ++a) if(!used[a] && a!=k)
0ea7f42c5c 2012-09-02        kinaba: 					hh.push_back(heights[a]);
0ea7f42c5c 2012-09-02        kinaba: 				int ss = current_score;
0ea7f42c5c 2012-09-02        kinaba: 				if(!current.empty()) ss += max(current.back(), heights[k]);
0ea7f42c5c 2012-09-02        kinaba: 				ss += best_for(heights[k], hh);
0ea7f42c5c 2012-09-02        kinaba: 				if( ss == best ) {
0ea7f42c5c 2012-09-02        kinaba: 					answer.push_back(k);
0ea7f42c5c 2012-09-02        kinaba: 					if(!current.empty()) current_score += max(current.back(), heights[k]);
0ea7f42c5c 2012-09-02        kinaba: 					current.push_back(heights[k]);
0ea7f42c5c 2012-09-02        kinaba: 					used[k] = true;
0ea7f42c5c 2012-09-02        kinaba: 					break;
0ea7f42c5c 2012-09-02        kinaba: 				}
0ea7f42c5c 2012-09-02        kinaba: 			}
0ea7f42c5c 2012-09-02        kinaba: 		}
0ea7f42c5c 2012-09-02        kinaba: 		return answer;
0ea7f42c5c 2012-09-02        kinaba: 	}
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: 	int best_for(vector<int> h)
0ea7f42c5c 2012-09-02        kinaba: 	{
0ea7f42c5c 2012-09-02        kinaba: 		sort(h.begin(), h.end());
0ea7f42c5c 2012-09-02        kinaba: 		int best = 0;
0ea7f42c5c 2012-09-02        kinaba: 		for(int i=0; i+1<h.size(); ++i)
0ea7f42c5c 2012-09-02        kinaba: 			best += max(h[i], h[i+1]);
0ea7f42c5c 2012-09-02        kinaba: 		return best;
0ea7f42c5c 2012-09-02        kinaba: 	}
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: 	int best_for(int h0, vector<int> h)
0ea7f42c5c 2012-09-02        kinaba: 	{
0ea7f42c5c 2012-09-02        kinaba: 		if(h.empty())
0ea7f42c5c 2012-09-02        kinaba: 			return 0;
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: 		sort(h.begin(), h.end());
0ea7f42c5c 2012-09-02        kinaba: 		int best = max(h0, h[0]);
0ea7f42c5c 2012-09-02        kinaba: 		for(int i=0; i+1<h.size(); ++i)
0ea7f42c5c 2012-09-02        kinaba: 			best += max(h[i], h[i+1]);
0ea7f42c5c 2012-09-02        kinaba: 		return best;
0ea7f42c5c 2012-09-02        kinaba: 	}
0ea7f42c5c 2012-09-02        kinaba: };
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: // BEGIN CUT HERE
0ea7f42c5c 2012-09-02        kinaba: #include <ctime>
0ea7f42c5c 2012-09-02        kinaba: double start_time; string timer()
0ea7f42c5c 2012-09-02        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
0ea7f42c5c 2012-09-02        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
0ea7f42c5c 2012-09-02        kinaba:  { os << "{ ";
0ea7f42c5c 2012-09-02        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
0ea7f42c5c 2012-09-02        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
0ea7f42c5c 2012-09-02        kinaba: void verify_case(const vector <int>& Expected, const vector <int>& Received) {
0ea7f42c5c 2012-09-02        kinaba:  bool ok = (Expected == Received);
0ea7f42c5c 2012-09-02        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
0ea7f42c5c 2012-09-02        kinaba:  cerr << "\to: " << Expected << endl << "\tx: " << Received << endl; } }
0ea7f42c5c 2012-09-02        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
0ea7f42c5c 2012-09-02        kinaba: #define END	 verify_case(_, TheBrickTowerMediumDivOne().find(heights));}
0ea7f42c5c 2012-09-02        kinaba: int main(){
0ea7f42c5c 2012-09-02        kinaba: 
0ea7f42c5c 2012-09-02        kinaba: CASE(0)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {4, 7, 5};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	int __[] = {0, 2, 1 };
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: CASE(1)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {4, 4, 4, 4, 4, 4, 4};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	int __[] = {0, 1, 2, 3, 4, 5, 6 };
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: CASE(2)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {2, 3, 3, 2};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	int __[] = {0, 3, 1, 2 };
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: CASE(3)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {13, 32, 38, 25, 43, 47, 6};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	int __[] = {0, 6, 3, 1, 2, 4, 5 };
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _(__, __+sizeof(__)/sizeof(*__));
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: CASE(4)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {28,36,27,33,30,18,16,23,39,31,4,40,41,41,30,43,45,16,5,26,35,19,2,40,27,3,37,46,5,34,22,25,19,6,45,6,45,36,40,13,29,25,10,23,6,3,21};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _;
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: CASE(5)
0ea7f42c5c 2012-09-02        kinaba: 	int heights_[] = {7,34,5,15,43,8,36,5,42,22,37,45,46,38,40,2,3,22,35,23,14,31,26,1,43,11,24,41,21,8,11,28,46,21,42,5,9,18,4,3,47,15,32,16,26,45,34};
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> heights(heights_, heights_+sizeof(heights_)/sizeof(*heights_));
0ea7f42c5c 2012-09-02        kinaba: 	  vector <int> _;
0ea7f42c5c 2012-09-02        kinaba: END
0ea7f42c5c 2012-09-02        kinaba: }
0ea7f42c5c 2012-09-02        kinaba: // END CUT HERE