C ++ program to find maximum sum possible such that exactly floor ( N / 2 ) elements are selected and no two selected elements are adjacent to each other
#include <bits/stdc++.h> NEW_LINE using namespace std ;