4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <functional>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class RowGame { public:
4fd800b3a8 2011-02-23        kinaba: 	long long score(vector <int> board, int k)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int N = board.size();
4fd800b3a8 2011-02-23        kinaba: 		vector<LL> best(N, -1);
4fd800b3a8 2011-02-23        kinaba: 		best[0] = 0;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		LL bestOfBest = 0;
4fd800b3a8 2011-02-23        kinaba: 		LL dif = -1, loopCnt = 0;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int dir=+1;
4fd800b3a8 2011-02-23        kinaba: 		for(int ki=0; ki<k; ++ki, dir=-dir)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			vector<LL> best2(N, -1);
4fd800b3a8 2011-02-23        kinaba: 			for(int s=0; s<N; ++s)
4fd800b3a8 2011-02-23        kinaba: 				if( best[s] >= 0 )
4fd800b3a8 2011-02-23        kinaba: 				{
4fd800b3a8 2011-02-23        kinaba: 					LL sum = 0;
4fd800b3a8 2011-02-23        kinaba: 					for(int t=s; 0<=t && t<N; t+=dir) {
4fd800b3a8 2011-02-23        kinaba: 						sum += board[t];
4fd800b3a8 2011-02-23        kinaba: 						if( best[s]+sum >= 0 )
4fd800b3a8 2011-02-23        kinaba: 						best2[t] = max(best2[t], best[s]+sum);
4fd800b3a8 2011-02-23        kinaba: 					}
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 			best.swap(best2);
4fd800b3a8 2011-02-23        kinaba: 			LL bb2 = max(bestOfBest, *max_element(best.begin(), best.end()));
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				if( bb2-bestOfBest == dif )
4fd800b3a8 2011-02-23        kinaba: 					++loopCnt;
4fd800b3a8 2011-02-23        kinaba: 				else {
4fd800b3a8 2011-02-23        kinaba: 					loopCnt = 0;
4fd800b3a8 2011-02-23        kinaba: 					dif = bb2-bestOfBest;
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 				if( loopCnt >= 2501 )
4fd800b3a8 2011-02-23        kinaba: 					return bestOfBest + dif*(k-ki);
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			bestOfBest = bb2;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return bestOfBest;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time; string timer()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const long long& Expected, const long long& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, RowGame().score(board, k));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {2,-2,4,3,-10} ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 3;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 21LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {-6,5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 10;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 0LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {5,-6};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 10;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 50LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {10,-100,80};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 3;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 30LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {10,-100,80};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 4;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 90LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = {-100,1,2,3,4,5,6,7,8,9,10,11,12,13,14};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = 400000000;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 41999999900LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = ;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	int board_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> board(board_, board_+sizeof(board_)/sizeof(*board_));
4fd800b3a8 2011-02-23        kinaba: 	int k = ;
4fd800b3a8 2011-02-23        kinaba: 	long long _ = LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE