andmej / acm

My solutions for problems from the UVa Online Judge (Valladolid).

This URL has Read+Write access

acm / 10003 - Cutting sticks / 10003.3.cpp
100644 54 lines (46 sloc) 0.923 kb
raw blame history 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

#include <iostream>
#include <map>
#include <algorithm>
#include <climits>
#include <vector>
 
using namespace std;
 
vector<int> p;
int cache[1001][1001];
 
int f(int i, int j){
  if (cache[i][j] != -1){
    return cache[i][j];
  }
  if (j < i) swap(i, j);
  
  for (int k=0; k<p.size()-1; ++k){
    if (p[k] <= i && i <= p[k+1] &&
	p[k] <= j && j <= p[k+1]){
      return cache[i][j] = 0;
    }
  }
 
  int min = INT_MAX;
  for (int k=0; k<p.size(); ++k){
    if (i < p[k] && p[k] < j){
      int q = j - i + f(i, p[k]) + f(p[k], j);      
      if (q < min){
	min = q;
      }
    }
  }
  return   cache[i][j] = min;
  
}
 
int main(){
  int l;
  while (cin >> l && l > 0){
    int n;
    cin >> n;
    memset(cache, -1, sizeof(cache));
    p = vector<int>(n+2);
    p[0] = 0;
    p[n+1] = l;
    for (int i=1; i<=n; ++i){
      cin >> p[i];
    }
    cout << "The minimum cutting is " << f(0, l) << ".\n";
  }
  return 0;
}