Question

求哪位大佬帮我详细解释一下这个代码的思路，有点迷

求哪位大佬帮我详细解释一下这个代码的思路，有点迷#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int INF = 1<<30;
const int N = 20;
int n, r[N];
double pos[N];
double sum;
void dfs(int index) {
if(index == n+1) {
int r1, r2;
for(int i = 1; i <= n; i++) {
pos[i] = r[i];
for(int j = 1; j < i; j++) {
r1 = r[i];r2 = r[j];
pos[i] = max(pos[i], pos[j]+sqrt((r1+r2)*(r1+r2)-(r1-r2)*(r1-r2)));
}
}
sum = min(sum, pos[n]-pos[1]+r[1]+r[n]);
return;
}
for(int i = index; i <= n; i++) {
swap(r[index], r[i]);
dfs(index+1);
swap(r[index], r[i]);
}
}
int main() {
scanf("%d", &n);
sum = INF;
for(int i = 1; i <= n; i++)
scanf("%d", &r[i]);
dfs(1);
printf("%lf\n", sum);
return 0;
}

Answer 1

#include"stdio.h"
int GetApple(int a[],int height,int n)
{
int i;
n=0;
for(i=0;i<10;i++)
{
if(a[i]<=height)
n++;
}
return n;
}
int main()
{
int i,a[10],height=30,h,n=0;
printf("输入10个苹果的高度：");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
printf("\n输入淘淘的身高");
scanf("%d",&h);
height+=h;
n=GetApple(a,height,n);
printf("%d\n",n);
return 0;

}

Answer 2

你问的方式我也很迷， 难道从第一句开始给你讲？

追问

从定义那个不可变常量开始可以不

这个是算法的圆排列问题