UVA - 11691(dp 集合类)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef unsigned long long LLU;
const int maxn = (1<<20);
int d[maxn][7],a[21],n;
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
        }
        int N = (1<<n);
        for(int s=N-1;s>=0;s--)
         for(int i=0;i<=6;i++){
           if(s == N-1){
             d[s][i] = i;
             continue;
           }
           d[s][i] = 1e6;
           for(int j=0;j<n;j++)if(!(s&(1<<j))){
              int le,add;
              if(a[j] > i) {le = a[j]-i-1;}
              else {le = 0;}
              d[s][i] = min(d[s][i],d[s|(1<<j)][le]+i+1);
           }
        }
        cout<<d[0][0]<<endl;
    }
    return 0;
}