uva1336 Fixing the Great Wall

用到了kase避免memset超时

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cassert>
using namespace std;

const int maxn =  + ;
const double INF = 1e30;

struct Section {
  double x, c, dt;
  bool operator < (const Section& rhs) const {
    return x < rhs.x;
  }
} s[maxn];

int kase, n;
int vis[maxn][maxn][];
double v, x, d[maxn][maxn][];
double psdt[maxn]; // prefix sum of dt

// cost accumulated when walking from x1 and x2.
// section[i~j] are already finished
double cost(double x1, double x2, int i, int j) {
  double finished_dt = ;
  assert(i <= j);//not necessary
  if(i >=  && j >= ) finished_dt += psdt[j] - psdt[i-];  // -1 -1�����
  return (psdt[n] - finished_dt) * fabs(x2 - x1) / v;
}

double dp(int i, int j, int p) {        //p=0��ǰ��i,p=1��ǰ��j
  if(i ==  && j == n) return ;
  double& ans = d[i][j][p];
  if(vis[i][j][p] == kase) return ans;
  vis[i][j][p] = kase;

  ans=INF;
  double x = (p ==  ? s[i].x : s[j].x);
  if(i > ) ans = min(ans, dp(i-, j, ) + cost(x, s[i-].x, i, j));
  if(j < n) ans = min(ans, dp(i, j+, ) + cost(x, s[j+].x, i, j));
  return ans;
}

int main() {
  memset(vis, , sizeof(vis));
  while(scanf("%d%lf%lf", &n, &v, &x) ==  && n) {
    kase++;
    double sumc = ;
    for(int i = ; i <= n; i++) {
      scanf("%lf%lf%lf", &s[i].x, &s[i].c, &s[i].dt);
      sumc += s[i].c;
    }
    sort(s+, s+n+);

    psdt[] = ;
    for(int i = ; i <= n; i++)
      psdt[i] = psdt[i-] + s[i].dt;

    s[].x = -INF;
    s[n+].x = INF;
    double ans = INF;
    for(int i = ; i <= n+; i++)
      if(x > s[i-].x && x < s[i].x) {
        if(i > )
            ans = min(ans, dp(i-, i-, ) + cost(x, s[i-].x, -, -)); // move left
        if(i <= n)
            ans = min(ans, dp(i, i, ) + cost(x, s[i].x, -, -)); // move right
        break;
      }
    printf("%.0lf\n", floor(ans + sumc));
  }
  return ;
}