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 IncreasingSubsequences { public: 4fd800b3a8 2011-02-23 kinaba: long long count(vector <int> a) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: a.insert(a.begin(), -1); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int N = a.size(); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector< vector<int> > next(N); 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<N; ++i) { 4fd800b3a8 2011-02-23 kinaba: int L = a[i]+1; 4fd800b3a8 2011-02-23 kinaba: int R = INT_MAX; 4fd800b3a8 2011-02-23 kinaba: for(int j=i+1; j<N; ++j) 4fd800b3a8 2011-02-23 kinaba: if( L<=a[j] && a[j]<=R ) { 4fd800b3a8 2011-02-23 kinaba: next[i].push_back(j); 4fd800b3a8 2011-02-23 kinaba: R = a[j]; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector<LL> num(N); 4fd800b3a8 2011-02-23 kinaba: for(int i=N-1; i>=0; --i) { 4fd800b3a8 2011-02-23 kinaba: if( next[i].size() == 0 ) 4fd800b3a8 2011-02-23 kinaba: num[i] = 1; 4fd800b3a8 2011-02-23 kinaba: else 4fd800b3a8 2011-02-23 kinaba: for(int j=0; j<next[i].size(); ++j) 4fd800b3a8 2011-02-23 kinaba: num[i] += num[next[i][j]]; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: return num[0]; 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(_, IncreasingSubsequences().count(a));} 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 a_[] = {1,3,2,6,4,5}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 4LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int a_[] = {1000000000,100000000,10000000,1000000,100000,10000,1000,100,10,1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 10LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int a_[] = {1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int a_[] = {564,234,34,4365,424,2234,306,21,934,592,195,2395,2396,29345,13295423,23945,2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 41LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int a_[] = {1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int a_[] = {5,4,3,2,1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> a(a_, a_+sizeof(a_)/sizeof(*a_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 5LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE