Input -> Output

[[1]] -> 1

[[1, 3], [1, 3]] -> 4

[[1, 4, 2], [5, 6, 1]] -> 9

[[-2, -21],[18, 2]] -> 0

[[1, 2, 3], [4, 5, 6], [7, 8, 9]] -> 15

[[1, 2, 3, 4], [5, 4, 3, 2], [6, 2, 7, 1]] -> 16

Input -> Output

[[1]] -> 1

[[1, 3], [1, 3]] -> 4

[[1, 4, 2], [5, 6, 1]] -> 9

[[-2, -21],[18, 2]] -> 0

[[1, 2, 3], [4, 5, 6], [7, 8, 9]] -> 15

[[1, 2, 3, 4], [5, 4, 3, 2], [6, 2, 7, 1]] -> 16

Input -> Output

[[1]] -> 1

[[1, 3], [1, 3]] -> 4

[[1, 4, 2], [5, 6, 1]] -> 9

[[-2, -21],[18, 2]] -> 0

[[1, 2, 3], [4, 5, 6], [7, 8, 9]] -> 15

[[1, 2, 3, 4], [5, 4, 3, 2], [6, 2, 7, 1]] -> 16

Input -> Output

[[1]] -> 1

[[1, 3], [1, 3]] -> 4

[[1, 4, 2], [5, 6, 1]] -> 9

[[-2, -21],[18, 2]] -> 0

[[1, 2, 3], [4, 5, 6], [7, 8, 9]] -> 15

[[1, 2, 3, 4], [5, 4, 3, 2], [6, 2, 7, 1]] -> 16

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "200"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});

active

oldest

votes

f=([a,...r],s=m=0,k,i=1)=>a+a?a.map(n=>k&(i*=2)||f(r,s+n,k|i))|m:m<s?m=s:m

f=([a,...r],s=m=0,k,i=1)=>a+a?a.map(n=>k&(i*=2)||f(r,s+n,k|i))|m:m<s?m=s:m

f=([a,...r],s=m=0,k,i=1)=>a+a?a.map(n=>k&(i*=2)||f(r,s+n,k|i))|m:m<s?m=s:m

f=([a,...r],s=m=0,k,i=1)=>a+a?a.map(n=>k&(i*=2)||f(r,s+n,k|i))|m:m<s?m=s:m

add a comment | 

ẈŒpQƑƇị"€¹§Ṁ

ẈŒpQƑƇị"€¹§Ṁ  Main link. Argument: M (matrix)



Ẉ             Widths; compute the length of each row.

              For an n×m matrix, this yields an array m copies of n.

 Œp           Cartesian product; promote each n to [1, ..., n], then form all arrays

              that pick one k out of all m copies of [1, ..., n].

   QƑƇ        Comb by fixed unique; keep only arrays that do not change by

              deduplicating their entries.

         ¹    Identity; yield M.

      ị"€     For each of the arrays of unique elements, use its m entries to index

              into the m rows of M.

          §   Take the sums of all resulting vectors.

           Ṁ  Take the maximum.

ẈŒpQƑƇị"€¹§Ṁ

ẈŒpQƑƇị"€¹§Ṁ  Main link. Argument: M (matrix)



Ẉ             Widths; compute the length of each row.

              For an n×m matrix, this yields an array m copies of n.

 Œp           Cartesian product; promote each n to [1, ..., n], then form all arrays

              that pick one k out of all m copies of [1, ..., n].

   QƑƇ        Comb by fixed unique; keep only arrays that do not change by

              deduplicating their entries.

         ¹    Identity; yield M.

      ị"€     For each of the arrays of unique elements, use its m entries to index

              into the m rows of M.

          §   Take the sums of all resulting vectors.

           Ṁ  Take the maximum.

ẈŒpQƑƇị"€¹§Ṁ

ẈŒpQƑƇị"€¹§Ṁ  Main link. Argument: M (matrix)



Ẉ             Widths; compute the length of each row.

              For an n×m matrix, this yields an array m copies of n.

 Œp           Cartesian product; promote each n to [1, ..., n], then form all arrays

              that pick one k out of all m copies of [1, ..., n].

   QƑƇ        Comb by fixed unique; keep only arrays that do not change by

              deduplicating their entries.

         ¹    Identity; yield M.

      ị"€     For each of the arrays of unique elements, use its m entries to index

              into the m rows of M.

          §   Take the sums of all resulting vectors.

           Ṁ  Take the maximum.

ẈŒpQƑƇị"€¹§Ṁ

ẈŒpQƑƇị"€¹§Ṁ  Main link. Argument: M (matrix)



Ẉ             Widths; compute the length of each row.

              For an n×m matrix, this yields an array m copies of n.

 Œp           Cartesian product; promote each n to [1, ..., n], then form all arrays

              that pick one k out of all m copies of [1, ..., n].

   QƑƇ        Comb by fixed unique; keep only arrays that do not change by

              deduplicating their entries.

         ¹    Identity; yield M.

      ị"€     For each of the arrays of unique elements, use its m entries to index

              into the m rows of M.

          §   Take the sums of all resulting vectors.

           Ṁ  Take the maximum.

add a comment | 

f=lambda x,y=:x>and max(e+f(x[1:],y+[i])for(i,e)in enumerate(x[0])if i not in y)

f=lambda x,y=:x>and max(e+f(x[1:],y+[i])for(i,e)in enumerate(x[0])if i not in y)

f=lambda x,y=:x>and max(e+f(x[1:],y+[i])for(i,e)in enumerate(x[0])if i not in y)

f=lambda x,y=:x>and max(e+f(x[1:],y+[i])for(i,e)in enumerate(x[0])if i not in y)

add a comment |