SRM463 Div2 Easy(250) BunnyPuzzle
BunnyPuzzle
#include <vector> using namespace std; class BunnyPuzzle { public: int theCount( vector <int> bunnies ); }; int BunnyPuzzle::theCount( vector <int> bunnies ) { int n = (int)bunnies.size(); int c = 0; for ( int i=0; i<n-1; i++ ) { int a = bunnies[i]; int b = bunnies[i+1]; if ( i+2 == n || bunnies[i+2] > 2*b-a ) c++; if ( i-1 == -1 || bunnies[i-1] < 2*a-b ) c++; } return c; }