已知程序：
#include <stdio.h>
main()
{
    int m[7]={7,6,5,4,3,2,1};
    int n[7]={22,6,5,4,3,2,1};
    char a[7]={0};
    int i,j, mc, nc;
    char sm[256], sn[256];
    for (i=0; i<7; i++)
    {
        for (j=1; j<=i; j++)
            a[j] = 1;
        while (1)
        {
            mc = m[0];
            nc = n[0];
            sprintf(sm, "%s", "m0");
            sprintf(sn, "%s", "n0");
            for (j=1; j<=i; j++)
            {
                if (a[j])
                {
                    mc += m[j];
                    nc += n[j];
                    sprintf(sm, "%s+m%d", sm,j);
                    sprintf(sn, "%s+n%d", sn,j);
                }
                else
                {
                    mc -= m[j];
                    nc -= n[j];
                    sprintf(sm, "%s-m%d", sm,j);
                    sprintf(sn, "%s-n%d", sn,j);
                }
            }
            printf("%s/%s = ", sm,sn);
            printf("%lf\n", (double)mc/nc);
            for (j=i; j>0; j--)
            {
                if (a[j])
                {
                    a[j] = 0;
                    break;
                }
            }
            if (j == 0)
                break;
            for (++j; j<=i; j++)
                a[j] = 1;   
        }
        printf("\n===============================\n");
    }
}
运行结果：
m0/n0 = 0.318182

===============================
m0+m1/n0+n1 = 0.464286
m0-m1/n0-n1 = 0.062500

===============================
m0+m1+m2/n0+n1+n2 = 0.545455
m0+m1-m2/n0+n1-n2 = 0.347826
m0-m1+m2/n0-n1+n2 = 0.285714
m0-m1-m2/n0-n1-n2 = -0.363636

===============================
m0+m1+m2+m3/n0+n1+n2+n3 = 0.594595
m0+m1+m2-m3/n0+n1+n2-n3 = 0.482759
m0+m1-m2+m3/n0+n1-n2+n3 = 0.444444
m0+m1-m2-m3/n0+n1-n2-n3 = 0.210526
m0-m1+m2+m3/n0-n1+n2+n3 = 0.400000
m0-m1+m2-m3/n0-n1+n2-n3 = 0.117647
m0-m1-m2+m3/n0-n1-n2+n3 = 0.000000
m0-m1-m2-m3/n0-n1-n2-n3 = -1.142857

===============================
m0+m1+m2+m3+m4/n0+n1+n2+n3+n4 = 0.625000
m0+m1+m2+m3-m4/n0+n1+n2+n3-n4 = 0.558824
m0+m1+m2-m3+m4/n0+n1+n2-n3+n4 = 0.531250
m0+m1+m2-m3-m4/n0+n1+n2-n3-n4 = 0.423077
m0+m1-m2+m3+m4/n0+n1-n2+n3+n4 = 0.500000
m0+m1-m2+m3-m4/n0+n1-n2+n3-n4 = 0.375000
m0+m1-m2-m3+m4/n0+n1-n2-n3+n4 = 0.318182
m0+m1-m2-m3-m4/n0+n1-n2-n3-n4 = 0.062500
m0-m1+m2+m3+m4/n0-n1+n2+n3+n4 = 0.464286
m0-m1+m2+m3-m4/n0-n1+n2+n3-n4 = 0.318182
m0-m1+m2-m3+m4/n0-n1+n2-n3+n4 = 0.250000
m0-m1+m2-m3-m4/n0-n1+n2-n3-n4 = -0.071429
m0-m1-m2+m3+m4/n0-n1-n2+n3+n4 = 0.166667
m0-m1-m2+m3-m4/n0-n1-n2+n3-n4 = -0.250000
m0-m1-m2-m3+m4/n0-n1-n2-n3+n4 = -0.500000
m0-m1-m2-m3-m4/n0-n1-n2-n3-n4 = -2.750000

===============================
m0+m1+m2+m3+m4+m5/n0+n1+n2+n3+n4+n5 = 0.642857
m0+m1+m2+m3+m4-m5/n0+n1+n2+n3+n4-n5 = 0.605263
m0+m1+m2+m3-m4+m5/n0+n1+n2+n3-n4+n5 = 0.583333
m0+m1+m2+m3-m4-m5/n0+n1+n2+n3-n4-n5 = 0.531250
m0+m1+m2-m3+m4+m5/n0+n1+n2-n3+n4+n5 = 0.558824
m0+m1+m2-m3+m4-m5/n0+n1+n2-n3+n4-n5 = 0.500000
m0+m1+m2-m3-m4+m5/n0+n1+n2-n3-n4+n5 = 0.464286
m0+m1+m2-m3-m4-m5/n0+n1+n2-n3-n4-n5 = 0.375000
m0+m1-m2+m3+m4+m5/n0+n1-n2+n3+n4+n5 = 0.531250
m0+m1-m2+m3+m4-m5/n0+n1-n2+n3+n4-n5 = 0.464286
m0+m1-m2+m3-m4+m5/n0+n1-n2+n3-n4+n5 = 0.423077
m0+m1-m2+m3-m4-m5/n0+n1-n2+n3-n4-n5 = 0.318182
m0+m1-m2-m3+m4+m5/n0+n1-n2-n3+n4+n5 = 0.375000
m0+m1-m2-m3+m4-m5/n0+n1-n2-n3+n4-n5 = 0.250000
m0+m1-m2-m3-m4+m5/n0+n1-n2-n3-n4+n5 = 0.166667
m0+m1-m2-m3-m4-m5/n0+n1-n2-n3-n4-n5 = -0.071429
m0-m1+m2+m3+m4+m5/n0-n1+n2+n3+n4+n5 = 0.500000
m0-m1+m2+m3+m4-m5/n0-n1+n2+n3+n4-n5 = 0.423077
m0-m1+m2+m3-m4+m5/n0-n1+n2+n3-n4+n5 = 0.375000
m0-m1+m2+m3-m4-m5/n0-n1+n2+n3-n4-n5 = 0.250000
m0-m1+m2-m3+m4+m5/n0-n1+n2-n3+n4+n5 = 0.318182
m0-m1+m2-m3+m4-m5/n0-n1+n2-n3+n4-n5 = 0.166667
m0-m1+m2-m3-m4+m5/n0-n1+n2-n3-n4+n5 = 0.062500
m0-m1+m2-m3-m4-m5/n0-n1+n2-n3-n4-n5 = -0.250000
m0-m1-m2+m3+m4+m5/n0-n1-n2+n3+n4+n5 = 0.250000
m0-m1-m2+m3+m4-m5/n0-n1-n2+n3+n4-n5 = 0.062500
m0-m1-m2+m3-m4+m5/n0-n1-n2+n3-n4+n5 = -0.071429
m0-m1-m2+m3-m4-m5/n0-n1-n2+n3-n4-n5 = -0.500000
m0-m1-m2-m3+m4+m5/n0-n1-n2-n3+n4+n5 = -0.250000
m0-m1-m2-m3+m4-m5/n0-n1-n2-n3+n4-n5 = -0.875000
m0-m1-m2-m3-m4+m5/n0-n1-n2-n3-n4+n5 = -1.500000
m0-m1-m2-m3-m4-m5/n0-n1-n2-n3-n4-n5 = -6.500000

===============================
m0+m1+m2+m3+m4+m5+m6/n0+n1+n2+n3+n4+n5+n6 = 0.651163
m0+m1+m2+m3+m4+m5-m6/n0+n1+n2+n3+n4+n5-n6 = 0.634146
m0+m1+m2+m3+m4-m5+m6/n0+n1+n2+n3+n4-n5+n6 = 0.615385
m0+m1+m2+m3+m4-m5-m6/n0+n1+n2+n3+n4-n5-n6 = 0.594595
m0+m1+m2+m3-m4+m5+m6/n0+n1+n2+n3-n4+n5+n6 = 0.594595
m0+m1+m2+m3-m4+m5-m6/n0+n1+n2+n3-n4+n5-n6 = 0.571429
m0+m1+m2+m3-m4-m5+m6/n0+n1+n2+n3-n4-n5+n6 = 0.545455
m0+m1+m2+m3-m4-m5-m6/n0+n1+n2+n3-n4-n5-n6 = 0.516129
m0+m1+m2-m3+m4+m5+m6/n0+n1+n2-n3+n4+n5+n6 = 0.571429
m0+m1+m2-m3+m4+m5-m6/n0+n1+n2-n3+n4+n5-n6 = 0.545455
m0+m1+m2-m3+m4-m5+m6/n0+n1+n2-n3+n4-n5+n6 = 0.516129
m0+m1+m2-m3+m4-m5-m6/n0+n1+n2-n3+n4-n5-n6 = 0.482759
m0+m1+m2-m3-m4+m5+m6/n0+n1+n2-n3-n4+n5+n6 = 0.482759
m0+m1+m2-m3-m4+m5-m6/n0+n1+n2-n3-n4+n5-n6 = 0.444444
m0+m1+m2-m3-m4-m5+m6/n0+n1+n2-n3-n4-n5+n6 = 0.400000
m0+m1+m2-m3-m4-m5-m6/n0+n1+n2-n3-n4-n5-n6 = 0.347826
m0+m1-m2+m3+m4+m5+m6/n0+n1-n2+n3+n4+n5+n6 = 0.545455
m0+m1-m2+m3+m4+m5-m6/n0+n1-n2+n3+n4+n5-n6 = 0.516129
m0+m1-m2+m3+m4-m5+m6/n0+n1-n2+n3+n4-n5+n6 = 0.482759
m0+m1-m2+m3+m4-m5-m6/n0+n1-n2+n3+n4-n5-n6 = 0.444444
m0+m1-m2+m3-m4+m5+m6/n0+n1-n2+n3-n4+n5+n6 = 0.444444
m0+m1-m2+m3-m4+m5-m6/n0+n1-n2+n3-n4+n5-n6 = 0.400000
m0+m1-m2+m3-m4-m5+m6/n0+n1-n2+n3-n4-n5+n6 = 0.347826
m0+m1-m2+m3-m4-m5-m6/n0+n1-n2+n3-n4-n5-n6 = 0.285714
m0+m1-m2-m3+m4+m5+m6/n0+n1-n2-n3+n4+n5+n6 = 0.400000
m0+m1-m2-m3+m4+m5-m6/n0+n1-n2-n3+n4+n5-n6 = 0.347826
m0+m1-m2-m3+m4-m5+m6/n0+n1-n2-n3+n4-n5+n6 = 0.285714
m0+m1-m2-m3+m4-m5-m6/n0+n1-n2-n3+n4-n5-n6 = 0.210526
m0+m1-m2-m3-m4+m5+m6/n0+n1-n2-n3-n4+n5+n6 = 0.210526
m0+m1-m2-m3-m4+m5-m6/n0+n1-n2-n3-n4+n5-n6 = 0.117647
m0+m1-m2-m3-m4-m5+m6/n0+n1-n2-n3-n4-n5+n6 = 0.000000
m0+m1-m2-m3-m4-m5-m6/n0+n1-n2-n3-n4-n5-n6 = -0.153846
m0-m1+m2+m3+m4+m5+m6/n0-n1+n2+n3+n4+n5+n6 = 0.516129
m0-m1+m2+m3+m4+m5-m6/n0-n1+n2+n3+n4+n5-n6 = 0.482759
m0-m1+m2+m3+m4-m5+m6/n0-n1+n2+n3+n4-n5+n6 = 0.444444
m0-m1+m2+m3+m4-m5-m6/n0-n1+n2+n3+n4-n5-n6 = 0.400000
m0-m1+m2+m3-m4+m5+m6/n0-n1+n2+n3-n4+n5+n6 = 0.400000
m0-m1+m2+m3-m4+m5-m6/n0-n1+n2+n3-n4+n5-n6 = 0.347826
m0-m1+m2+m3-m4-m5+m6/n0-n1+n2+n3-n4-n5+n6 = 0.285714
m0-m1+m2+m3-m4-m5-m6/n0-n1+n2+n3-n4-n5-n6 = 0.210526
m0-m1+m2-m3+m4+m5+m6/n0-n1+n2-n3+n4+n5+n6 = 0.347826
m0-m1+m2-m3+m4+m5-m6/n0-n1+n2-n3+n4+n5-n6 = 0.285714
m0-m1+m2-m3+m4-m5+m6/n0-n1+n2-n3+n4-n5+n6 = 0.210526
m0-m1+m2-m3+m4-m5-m6/n0-n1+n2-n3+n4-n5-n6 = 0.117647
m0-m1+m2-m3-m4+m5+m6/n0-n1+n2-n3-n4+n5+n6 = 0.117647
m0-m1+m2-m3-m4+m5-m6/n0-n1+n2-n3-n4+n5-n6 = 0.000000
m0-m1+m2-m3-m4-m5+m6/n0-n1+n2-n3-n4-n5+n6 = -0.153846
m0-m1+m2-m3-m4-m5-m6/n0-n1+n2-n3-n4-n5-n6 = -0.363636
m0-m1-m2+m3+m4+m5+m6/n0-n1-n2+n3+n4+n5+n6 = 0.285714
m0-m1-m2+m3+m4+m5-m6/n0-n1-n2+n3+n4+n5-n6 = 0.210526
m0-m1-m2+m3+m4-m5+m6/n0-n1-n2+n3+n4-n5+n6 = 0.117647
m0-m1-m2+m3+m4-m5-m6/n0-n1-n2+n3+n4-n5-n6 = 0.000000
m0-m1-m2+m3-m4+m5+m6/n0-n1-n2+n3-n4+n5+n6 = 0.000000
m0-m1-m2+m3-m4+m5-m6/n0-n1-n2+n3-n4+n5-n6 = -0.153846
m0-m1-m2+m3-m4-m5+m6/n0-n1-n2+n3-n4-n5+n6 = -0.363636
m0-m1-m2+m3-m4-m5-m6/n0-n1-n2+n3-n4-n5-n6 = -0.666667
m0-m1-m2-m3+m4+m5+m6/n0-n1-n2-n3+n4+n5+n6 = -0.153846
m0-m1-m2-m3+m4+m5-m6/n0-n1-n2-n3+n4+n5-n6 = -0.363636
m0-m1-m2-m3+m4-m5+m6/n0-n1-n2-n3+n4-n5+n6 = -0.666667
m0-m1-m2-m3+m4-m5-m6/n0-n1-n2-n3+n4-n5-n6 = -1.142857
m0-m1-m2-m3-m4+m5+m6/n0-n1-n2-n3-n4+n5+n6 = -1.142857
m0-m1-m2-m3-m4+m5-m6/n0-n1-n2-n3-n4+n5-n6 = -2.000000
m0-m1-m2-m3-m4-m5+m6/n0-n1-n2-n3-n4-n5+n6 = -4.000000
m0-m1-m2-m3-m4-m5-m6/n0-n1-n2-n3-n4-n5-n6 = -14.000000

===============================
Press any key to continue

[此贴子已经被作者于2017-2-22 19:35编辑过]

试试用数组保存数据~

具体一点就是把要比较的数记录下来~然后找出最大值~

[此贴子已经被作者于2017-2-22 14:05编辑过]

mc, nc,用数组保存数据，语法逻辑怎么样合理？

你那个最大值是相对于什么而言的？用数组保存要比较的数据再从数组里面找出最大值就可以了~

例如：m[j]最大值是m[0],m[1],m[2],m[3],m[4],m[5],m[6],m[7],中的最大值；
      m[j]+m[j+1]最大值是m[0]+m[1]，m[1]+m[2]，m[2]+m[3]，m[3]+m[4]，m[4]+m[5]，m[5]+m[6]，中的最大值；

[此贴子已经被作者于2017-2-22 14:32编辑过]

这个我也要想想看才行~感觉累了~需要休息一下……~看看有没有其他人帮忙解答~

劳逸结合，保持好战略能力，前方还有很多挑战；

如果是都正整数，第一组m0+m1+m2+....就是最大值，否则就要计算比对。

看看过程和结果是不是这样：

#include <stdio.h>
main()
{
    int m[7]={7,-6,5,4,3,2,1};
    int n[7]={22,-6,5,4,3,2,1};
    char a[7]={0};
    int i,j, mc, nc, mmax,nmax;
    char sm[256], sn[256], smc[1024], snc[1024];
    printf("m[7]={7,-6,5,4,3,2,1}\n");
    printf("n[7]={22,-6,5,4,3,2,1}\n\n");
    for (i=0; i<7; i++)
    {
        for (j=1; j<=i; j++)
            a[j] = 1;
        mmax = m[0];
        nmax = n[0];
        while (1)
        {
            mc = m[0];
            nc = n[0];
            sprintf(sm, "%s", "m0");
            sprintf(sn, "%s", "n0");
            sprintf(smc, "%d", m[0]);
            sprintf(snc, "%d", n[0]);
            for (j=1; j<=i; j++)
            {
                if (a[j])
                {
                    mc += m[j];
                    nc += n[j];
                    sprintf(sm, "%s+m%d", sm,j);
                    sprintf(sn, "%s+n%d", sn,j);
                    sprintf(smc, "%s+%d", smc,m[j]);
                    sprintf(snc, "%s+%d", snc,n[j]);
                }
                else
                {
                    mc -= m[j];
                    nc -= n[j];
                    sprintf(sm, "%s-m%d", sm,j);
                    sprintf(sn, "%s-n%d", sn,j);
                    sprintf(smc, "%s-%d", smc,m[j]);
                    sprintf(snc, "%s-%d", snc,n[j]);
                }
            }
            if (mc > mmax)
            {
                mmax = mc;
                nmax = nc;
            }
            printf("(%s)/(%s) = ", sm,sn);
            printf("(%s)/(%s) = ", smc,snc);
            printf("%d/%d = ", mc,nc);
            if (nc != 0)
                printf("%lf\n", (double)mc/nc);
            else
                printf("∞\n");
            for (j=i; j>0; j--)
            {
                if (a[j])
                {
                    a[j] = 0;
                    break;
                }
            }
            if (j == 0)
                break;
            for (++j; j<=i; j++)
                a[j] = 1;   
        }
        if (nmax != 0)
            printf("最大值%d/%d = %lf\n", mmax,nmax,(double)mmax/nmax);
        printf("\n===============================\n");
    }
}
更正

[此贴子已经被作者于2017-2-22 15:47编辑过]

有正整数，0，负整数；

m[j]最大值是m[0],m[1],m[2],m[3],m[4],m[5],m[6],m[7],中的最大值；

m[j]+m[j+1]最大值是m[0]+m[1]，m[1]+m[2]，m[2]+m[3]，m[3]+m[4]，m[4]+m[5]，m[5]+m[6]，中的最大值；