For more algorithm, visit https://github.com/trhgquan/CPP

MaximumNonAdj.cpp

int max(int a, int b) {
	return (a > b) ? a : b;
}

int MaximumNonAdj(vector<int> adj) {
	int ret = INT_MIN;
	adj.insert(adj.begin(), 0);
	vector<int> F(adj.size(), 0);
	F[1] = max(adj[1], 0);

	for (int i = 2; i < adj.size(); ++i) {
		F[i] = max(F[i - 2] + adj[i], F[i - 1]);
		ret = max(F[i], ret);
	}

	return ret;
}