-
Notifications
You must be signed in to change notification settings - Fork 0
/
DPTaskAssignmentsClass.cs
85 lines (72 loc) · 1.63 KB
/
DPTaskAssignmentsClass.cs
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
using System;
using System.Collections.Generic;
using System.Text;
using System.IO;
namespace Algorithms
{
public class DPTaskAssignmentsClass
{
private int n; //Total tasks
private int m;
private int mn;
private int[] a; //machine A
private int[] b; //machine B
private bool[,,] p;
private int opt = 0;
public string TaskAssignments(string input)
{
TaskAssignmentsInit(input);
return dyna();
}
private void TaskAssignmentsInit(string input)
{
StringReader sr = new StringReader(input);
n = Convert.ToInt32(sr.ReadLine());
m = 0;
string[] aInputs = sr.ReadLine().Split(new char[]{' '});
a = new int[n];
for (int i = 0; i < n; i++)
{
a[i] = Convert.ToInt32(aInputs[i]);
if (a[i] > m)
m = a[i];
}
string[] bInputs = sr.ReadLine().Split(new char[] { ' ' });
b = new int[n];
for (int i = 0; i < n; i++)
{
b[i] = Convert.ToInt32(bInputs[i]);
if (b[i] > m)
m = b[i];
}
mn = m * n;
p = new bool[mn+1, mn+1, n+1];
}
private string dyna()
{
int i, j, k;
for(i = 0; i <= mn; i++)
for (j = 0; j <= mn; j++)
{
p[i,j,0] = true;
for (k = 1; k <= n; k++)
p[i, j, k] = false;
}
for(k = 1; k <= n; k++)
for(i = 0; i <= mn; i++)
for (j = 0; j <= mn; j++)
{
if (i - a[k - 1] >= 0) p[i,j,k] = p[i - a[k - 1], j, k - 1];
if (j - b[k - 1] >= 0) p[i,j,k] = (p[i,j,k] || p[i, j-b[k-1], k-1]);
}
for(i =0, opt = mn; i <= mn; i++)
for (j = 0; j <= mn; j++)
if (p[i, j, n])
{
int tmp = (i > j) ? i : j;
if (tmp < opt) opt = tmp;
}
return opt.ToString() ;
}
}
}