java给定一个整数n梯形_P4013 数字梯形问题 【网络流24题】

1 #include

2 #define dbg(x) cout << #x << "=" << x << endl

3 #define eps 1e-8

4 #define pi acos(-1.0)

5

6 using namespacestd;7 typedef long longLL;8 const int maxn = 1e5 +7;9 const int inf = 0x3f3f3f3f;10

11 intn, m, s, t;12 inthead[maxn],pre[maxn],inq[maxn],dis[maxn];13 int cnt = 1;14 int mincost = 0, maxflow = 0;15 structedge {16 intu,to,nxt,w,c;17 }e[maxn << 1];18

19 templateinline void read(T &res)20 {21 char c;T flag=1;22 while((c=getchar())'9')if(c=='-')flag=-1;res=c-'0';23 while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;24 }25

26 inline void BuildGraph(int u, int v, int w, intcost)27 {28 e[++cnt] = (edge){u, v, head[u], w, cost}, head[u] =cnt;29 e[++cnt] = (edge){v, u, head[v], 0, -cost}, head[v] = cnt;///反向边

30 }31

32 queueq;33

34 inline voidinit() {35 memset(head, 0, sizeof(head));36 memset(pre, 0, sizeof(pre));37 memset(inq, 0, sizeof(inq));38 memset(dis, 0, sizeof(dis));39 memset(e, 0, sizeof(e));40 while(!q.empty()) {41 q.pop();42 }43 mincost = maxflow = 0;44 cnt = 1;45 }46

47 bool SPFA(intx)48 {49 memset(inq, 0, sizeof(inq));50 for(int i = s; i <= t; i++) {51 dis[i] =inf;52 }53 q.push(x);54 dis[x] = 0;55 inq[x] = 1;56 while(!q.empty()) {57 int u =q.front();58 q.pop();59 inq[u] = 0;60 for(int i = head[u]; i; i =e[i].nxt) {61 int v = e[i].to, w =e[i].c;62 if(e[i].w > 0) {63 if(dis[u] + w

79 voidMCMF()80 {81 while(SPFA(s)) {82 int temp =inf;83 for(int i = pre[t]; i; i =pre[e[i].u]) {84 temp =min(temp, e[i].w);85 }86 for(int i = pre[t]; i; i =pre[e[i].u]) {87 e[i].w -=temp;88 e[i^1].w +=temp;89 mincost += e[i].c *temp;90 //printf("maxflow:%d mincost:%d\n",maxflow, mincost);

91 }92 maxflow +=temp;93 }94 }95

96 int a[1007][1007];97 int Depth_Size = 0;98

99 inline int id1(int a, intb) {100 return (a-1) * Depth_Size +b;101 }102

103 inline int id2(int a, intb) {104 return n * Depth_Size + (a - 1) * Depth_Size +b;105 }106

107 voidtask1() {108 //! 3 5 9 10 12 = 39109 //! 2 4 10 1 10 = 27

110 init();111 s = 0, t = n * Depth_Size * 3 + 1;112 int temp = m + 1;113 for ( int i = 1; i <= m; ++i ) {114 BuildGraph(s, id1(1, i), 1, 0);115 BuildGraph(id1(1, i), id2(1, i), 1, -a[1][i]);116 BuildGraph(id2(1, i), id1(2, i), 1, 0);117 BuildGraph(id2(1, i), id1(2, i + 1), 1, 0);118 //printf("u:%d v:%d cost:%d\n",id1(1, i), id2(1, i), -a[1][i]);

119 }120 for ( int i = 2; i <= n - 1; ++i ) {121 for ( int j = 1; j <= temp; ++j ) {122 BuildGraph(id1(i, j), id2(i, j), 1, -a[i][j]);123 BuildGraph(id2(i, j), id1(i + 1, j), 1, 0);124 BuildGraph(id2(i, j), id1(i + 1, j + 1), 1, 0);125 //printf("u:%d v:%d cost:%d\n",id1(i, j), id2(i, j), -a[i][j]);

126 }127 ++temp;128 }129 for ( int i = 1; i <= temp; ++i ) {130 BuildGraph(id1(n, i), id2(n, i), 1, -a[n][i]);131 BuildGraph(id2(n, i), t, 1, 0);132 //printf("u:%d v:%d cost:%d\n",id1(n, i), id2(n, i), -a[n][i]);

133 }134 //dbg(t);

135 MCMF();136 //dbg(maxflow);

137 cout << -mincost <

140 voidtask2() {141 init();142 s = 0, t = n * Depth_Size * 3 + 1;143 int temp = m + 1;144 for ( int i = 1; i <= m; ++i ) {145 BuildGraph(s, id1(1, i), 1, 0);146 BuildGraph(id1(1, i), id2(1, i), inf, -a[1][i]);147 BuildGraph(id2(1, i), id1(2, i), 1, 0);148 BuildGraph(id2(1, i), id1(2, i + 1), 1, 0);149 //printf("u:%d v:%d cost:%d\n",id1(1, i), id2(1, i), -a[1][i]);

150 }151 for ( int i = 2; i <= n - 1; ++i ) {152 for ( int j = 1; j <= temp; ++j ) {153 BuildGraph(id1(i, j), id2(i, j), inf, -a[i][j]);154 BuildGraph(id2(i, j), id1(i + 1, j), 1, 0);155 BuildGraph(id2(i, j), id1(i + 1, j + 1), 1, 0);156 //printf("u:%d v:%d cost:%d\n",id1(i, j), id2(i, j), -a[i][j]);

157 }158 ++temp;159 }160 for ( int i = 1; i <= temp; ++i ) {161 BuildGraph(id1(n, i), id2(n, i), inf, -a[n][i]);162 BuildGraph(id2(n, i), t, inf, 0);163 //printf("u:%d v:%d cost:%d\n",id1(n, i), id2(n, i), -a[n][i]);

164 }165 //dbg(t);

166 MCMF();167 //dbg(maxflow);

168 cout << -mincost <

171 voidtask3() {172 init();173 s = 0, t = n * Depth_Size * 3 + 1;174 int temp = m + 1;175 for ( int i = 1; i <= m; ++i ) {176 BuildGraph(s, id1(1, i), 1, 0);177 BuildGraph(id1(1, i), id2(1, i), inf, -a[1][i]);178 BuildGraph(id2(1, i), id1(2, i), inf, 0);179 BuildGraph(id2(1, i), id1(2, i + 1), inf, 0);180 //printf("u:%d v:%d cost:%d\n",id1(1, i), id2(1, i), -a[1][i]);

181 }182 for ( int i = 2; i <= n - 1; ++i ) {183 for ( int j = 1; j <= temp; ++j ) {184 BuildGraph(id1(i, j), id2(i, j), inf, -a[i][j]);185 BuildGraph(id2(i, j), id1(i + 1, j), inf, 0);186 BuildGraph(id2(i, j), id1(i + 1, j + 1), inf, 0);187 //printf("u:%d v:%d cost:%d\n",id1(i, j), id2(i, j), -a[i][j]);

188 }189 ++temp;190 }191 for ( int i = 1; i <= temp; ++i ) {192 BuildGraph(id1(n, i), id2(n, i), inf, -a[n][i]);193 BuildGraph(id2(n, i), t, inf, 0);194 //printf("u:%d v:%d cost:%d\n",id1(n, i), id2(n, i), -a[n][i]);

195 }196 //dbg(t);

197 MCMF();198 //dbg(maxflow);

199 cout << -mincost <

202 intmain()203 {204 //freopen("data.txt", "r", stdin);

205 read(m); read(n);206 Depth_Size =m;207 for ( int i = 1; i <= n; ++i ) {208 for ( int j = 1; j <= Depth_Size; ++j ) {209 read(a[i][j]);210 //printf("a[%d][%d]:%d%c",i, j, a[i][j], j == Depth_Size ? '\n' : ' ');

211 }212 ++Depth_Size;213 }214 task1();215 task2();216 task3();217 return 0;218 }