andmej / acm

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

This URL has Read+Write access

acm / 10003 - Cutting sticks / robado.cpp
100644 61 lines (44 sloc) 0.867 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
55
56
57
58
59
60
61

//http://acm.uva.es/board/viewtopic.php?t=1543&highlight=10003&sid=707852836d9f5e46db0ea0865323a05f
 
#include<stdio.h>
#include<values.h>
 
#define MAX 60
#define inf MAXLONG
 
int main()
{
 long L,N,i,j,n,x,y,q,l,k,t,sum,m[MAX][MAX],p[MAX];
 
 while(scanf("%ld",&L)==1 && L)
 {
   scanf("%ld",&N);
 
   y = 0;
 
   for(i=1;i<=N;i++)
       {
   scanf("%ld",&x);
   p[i] = x - y;
   y = x;
       }
   p[i] = L - y;
 
   n = i;
 
   for(i=0;i<=n;i++)
       m[i][i] = 0;
 
   for(l=2;l<=n;l++)
      {
   for(i=1;i<=n-l+1;i++)
      {
       j = i + l - 1;
       m[i][j] = inf;
 
 
       for(k=i;k<=j-1;k++)
          {
      q = m[i][k] + m[k+1][j] ;
 
      sum = 0;
 
      for(t=i;t<=j;t++)
          sum += p[t];
 
      q += sum;
 
      if(q<m[i][j])
         m[i][j] = q;
          }
      }
      }
 
    printf("The minimum cutting is %ld.\n",m[1][n]);
 }
 return 0;
}