1 条题解

  • 0
    @ 2025-9-10 9:00:39

    C :

    #include <math.h>
    #include <stdio.h>
    
    double Pl, Pr, C[1100], c;  // C[m] is cost to build m in a row
    
    int i,l,k,m,n,r;
    
    main(){
       while (3 == scanf("%d%lf%lf",&n,&Pl,&Pr)) {
          if (Pl+Pr == 0) {
             printf("%d.00\n",n);
             continue;
          }
          C[0] = 0;
          for (i=1;i<=n;i++) C[i] = 1e19;
          for (m=1;m<=n;m++) { 
             for (l=0;l<m;l++) {   // l dominoes on the left
                r = m-l-1;
                c = 1 + C[l] + C[r] + 
                    (1/(1-Pr-Pl)-1) * (1+ Pl/(Pr+Pl)*C[l] + Pr/(Pr+Pl)*C[r]);
                if (c < C[m]) C[m] = c;
             }
          }
          printf("%0.2lf\n",C[n]);
       }
    }
    
    • 1

    信息

    ID
    3608
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者