ccf-csp 任务调度，回溯算法我觉得ok神**wa了

 #include<iostream>
 #include<string.h>
 #include<cmath>
 #define M 41
 #define min(a,b) (a<b?a:b)
 #define max(a,b) (a>b?a:b)
 #define inf 1<<30
 using namespace std;
 int time[M][];
 int c1, c2, com, g, stime;//c1 c2存两个独立cpu的时间（不是同时进行 com存同时进行的时间 g存gpu的时间
 int n;
 void slove(int k, int c1, int c2, int com, int g, int sum)
 {
     if (k <= n)
         for (int i = ; i < ; i++)
             switch (i)
             {
             case ://1*cpu
                 c1 < c2 ? slove(k + , c1 + time[k][i], c2, com, g, max(max(c1 + time[k][i], c2) + com, g)) :
                     slove(k + , c1, c2 + time[k][i], com, g, max(max(c1, c2 + time[k][i]) + com, g));
                 break;
             case ://2*cpu
                 slove(k + , c1, c2, com + time[k][i], g, max(max(c1, c2) + com + time[k][i], g));
                 break;
             case :
                 c1 < c2 ? slove(k + , c1 + time[k][i], c2, com, g + time[k][i], max(max(c1 + time[k][i], c2) + com, g + time[k][i])) :
                     slove(k + , c1, c2 + time[k][i], com, g + time[k][i], max(max(c1, c2 + time[k][i]) + com, g + time[k][i]));
                 break;
             case  :
                 slove(k + , c1, c2, com + time[k][i], g + time[k][i], max(max(c1, c2) + com + time[k][i], g + time[k][i]));
                 break;
             }
     else
         if (stime >sum)
             stime = sum;
 }
 int main()
 {
     stime = inf;
     c1 = c2 = g = com = ;//初始化
     cin >> n;
     for (int i = ; i <= n; i++)
         for (int j = ; j < ; j++)
             cin >> time[i][j];
     slove(, , , , , );
     cout << stime << endl;
     return ;
 }