uva1412 Fund Management

状压dp

要再看看  例题9-17

/*
// UVa1412 Fund Management
// 本程序会超时，只是用来示范用编码/解码的方法编写复杂状态动态规划的方法
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;

const double INF = 1e30;
const int maxn = 8;
const int maxm = 100 + 5;

map<int, double> d[maxm];
map<int, int> opt[maxm], prevv[maxm];
int m, n, s[maxn], k[maxn], kk;
double c, price[maxn][maxm];
char name[maxn][10];

int encode(int* portfolio) {
  int h = 0;
  for(int i = 0; i < n; i++) h = h * 9 + portfolio[i];
  return h;
}

int decode(int h, int* portfolio) {
  int totlot = 0;
  for(int i = n-1; i >= 0; i--) {
    portfolio[i] = h % 9;
    totlot += portfolio[i];
    h /= 9;
  }
  return totlot;
}

void update(int oldh, int day, int h, double v, int o) {
  if(d[day].count(h) == 0 || v > d[day][h]) {
    d[day][h] = v;
    opt[day][h] = o;
    prevv[day][h] = oldh;
  }
}

double dp() {
  int portfolio[maxn];
  d[0][0] = c;
  for(int day = 0; day < m; day++)
    for(map<int, double>::iterator it = d[day].begin(); it != d[day].end(); it++) {
      int h = it->first;
      double v = it->second;
      int totlot = decode(h, portfolio);

      update(h, day+1, h, v, 0); // HOLD
      for(int i = 0; i < n; i++) {
        if(portfolio[i] < k[i] && totlot < kk && v >= price[i][day] - 1e-3) {
          portfolio[i]++;
          update(h, day+1, encode(portfolio), v - price[i][day], i+1); // BUY
          portfolio[i]--;
        }
        if(portfolio[i] > 0) {
          portfolio[i]--;
          update(h, day+1, encode(portfolio), v + price[i][day], -i-1); // SELL
          portfolio[i]++;
        }
      }
    }
  return d[m][0];
}

void print_ans(int day, int h) {
  if(day == 0) return;
  print_ans(day-1, prevv[day][h]);
  if(opt[day][h] == 0) printf("HOLD\n");
  else if(opt[day][h] > 0) printf("BUY %s\n", name[opt[day][h]-1]);
  else printf("SELL %s\n", name[-opt[day][h]-1]);
}

int main() {
  int kase = 0;
  while(scanf("%lf%d%d%d", &c, &m, &n, &kk) == 4) {
    if(kase++ > 0) printf("\n");
    for(int i = 0; i < n; i++) {
      scanf("%s%d%d", name[i], &s[i], &k[i]);
      for(int j = 0; j < m; j++) { scanf("%lf", &price[i][j]); price[i][j] *= s[i]; }
    }
    for(int i = 0; i <= m; i++) { d[i].clear(); opt[i].clear(); prevv[i].clear(); }

    double ans = dp();
    printf("%.2lf\n", ans);
    print_ans(m, 0);
  }
  return 0;
}
*/

#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
using namespace std;

const double INF = 1e30;
const int maxn = 8;
const int maxm = 100 + 5;
const int maxstate = 15000;

int m, n, s[maxn], k[maxn], kk;
double c, price[maxn][maxm];
char name[maxn][10];

double d[maxm][maxstate];
int opt[maxm][maxstate], prevv[maxm][maxstate];

int buy_next[maxstate][maxn], sell_next[maxstate][maxn];
vector<vector<int> > states;
map<vector<int>, int> ID;

void dfs(int stock, vector<int>& lots, int totlot) {
  if(stock == n) {
    ID[lots] = states.size();
    states.push_back(lots);
  }
  else for(int i = 0; i <= k[stock] && totlot + i <= kk; i++) {
    lots[stock] = i;
    dfs(stock+1, lots, totlot + i);
  }
}

void init() {
  vector<int> lots(n);
  states.clear();
  ID.clear();
  dfs(0, lots, 0);
  for(int s = 0; s < states.size(); s++) {
    int totlot = 0;
    for(int i = 0; i < n; i++) totlot += states[s][i];
    for(int i = 0; i < n; i++) {
      buy_next[s][i] = sell_next[s][i] = -1;
      if(states[s][i] < k[i] && totlot < kk) {
        vector<int> newstate = states[s];
        newstate[i]++;
        buy_next[s][i] = ID[newstate];
      }
      if(states[s][i] > 0) {
        vector<int> newstate = states[s];
        newstate[i]--;
        sell_next[s][i] = ID[newstate];
      }
    }
  }
}

void update(int day, int s, int s2, double v, int o) {
  if(v > d[day+1][s2]) {
    d[day+1][s2] = v;
    opt[day+1][s2] = o;
    prevv[day+1][s2] = s;
  }
}

double dp() {
  for(int day = 0; day <= m; day++)
    for(int s = 0; s < states.size(); s++) d[day][s] = -INF;

  d[0][0] = c;
  for(int day = 0; day < m; day++)
    for(int s = 0; s < states.size(); s++) {
      double v = d[day][s];
      if(v < -1) continue;

      update(day, s, s, v, 0); // HOLD
      for(int i = 0; i < n; i++) {
        if(buy_next[s][i] >= 0 && v >= price[i][day] - 1e-3)
          update(day, s, buy_next[s][i], v - price[i][day], i+1); // BUY
        if(sell_next[s][i] >= 0)
          update(day, s, sell_next[s][i], v + price[i][day], -i-1); // SELL
      }
    }
  return d[m][0];
}

void print_ans(int day, int s) {
  if(day == 0) return;
  print_ans(day-1, prevv[day][s]);
  if(opt[day][s] == 0) printf("HOLD\n");
  else if(opt[day][s] > 0) printf("BUY %s\n", name[opt[day][s]-1]);
  else printf("SELL %s\n", name[-opt[day][s]-1]);
}

int main() {
  int kase = 0;
  while(scanf("%lf%d%d%d", &c, &m, &n, &kk) == 4) {
    if(kase++ > 0) printf("\n");

    for(int i = 0; i < n; i++) {
      scanf("%s%d%d", name[i], &s[i], &k[i]);
      for(int j = 0; j < m; j++) { scanf("%lf", &price[i][j]); price[i][j] *= s[i]; }
    }
    init();

    double ans = dp();
    printf("%.2lf\n", ans);
    print_ans(m, 0);
  }
  return 0;
}

原文地址：https://www.cnblogs.com/lqerio/p/9860910.html