SRM507 Div2 Easy(250) CubeAnts
#include <vector> using namespace std; class CubeAnts{public: int getMinimumSteps( vector <int> pos ) { int D[] = { 0, 1, 2, 1, 1, 2, 3, 2 }; int ans = 0; for ( int i=0; i<(int)pos.size(); i++ ) ans = max( ans, D[pos[i]] ); return ans; }};