蓝桥杯算法提高-能量项链-题解（C语言代码）

解题思路:

注意事项:

参考代码:

#include <iostream>

using namespace std;

int countSum;

int minIndex(int* a,int n) {

int minNo = 1000;

int index = 0;

for (int i = 0; i < n; i++)

{

if (a[i]<minNo)

{

index = i;

minNo = a[i];

}

}

return index;

}

void dfs(int* a, int n) {

int minNo=minIndex(a, n);

if (n>=3)

{

if (minNo==0)

{

countSum += a[n - 1] * a[0] * a[1];

for (int i = 0; i < n-1; i++) a[i] = a[i + 1];

}

else if (minNo==(n-1)) countSum += a[n - 2] * a[n - 1] * a[0];

else

{

countSum += a[minNo - 1] * a[minNo] * a[minNo + 1];

for (int i = minNo; i < (n-1); i++) a[i] = a[i + 1];

}

dfs(a, n - 1);

}

else

countSum += a[minNo] * a[(n - 1) - minNo] * a[(n - 1) - minNo];

}

int main() {

int n = 0;

cin >> n;

int* a = new int[n];

for (int i = 0; i < n; i++) cin >> a[i];

dfs(a, n);

cout << countSum;

//system("pause");

return 0;

}