#includeiostreamusing namespace std;int a[2200];//记录价值int site[2200];//记录位置是否栽树int n,m,maxx;bool cont(int d){return (site[d]0site[(d-1n)%n]0site[(d1)%n]0);}void dfs(int x,int s,int sum){//x当前种树位置s剩余种树数量sum总价值site[x]1;suma[x];if(s){for(int ix2;in;i){if(cont(i)){dfs(i,s-1,sum);}}}else{if(summaxx)maxxsum;}site[x]0;}int main(){cinnm;for(int i0;in;i){cina[i];}if((n/2)m){for(int i0;in;i){dfs(i,m-1,0);}coutmaxxendl;}else{coutError!endl;}return 0;}