### Statement

There is a list of numbers to sort (ascending). Sorting can only be achieved through exchanges. Each exchange, you can choose any two of this column, exchange their positions, and the cost of the exchange is the sum of the two numbers. The total cost of sorting is the sum of all exchange costs in the sorting process. The first requirement is to calculate that for any given number of columns, it must be ranked as the minimum cost required for ascending order.

### Code

#include
using namespace std;
int f[207][607],Tlim,id;
void dfs(int u){
int len,x;cin>>len>>x;
len*=2;if (x){
for (int i=len;i<=Tlim;i++)
f[u][i]=min(x,(i-len)/5);
return;
}
int l=++id,r=++id,dfs(l),dfs(r);
for (int i=len;i<=Tlim;i++)
for (int j=0;j<=i-len;j++)
f[u][i]=max(f[u][i],f[l][j]+f[r][i-len-j]);
}
int main(){
ios::sync_with_stdio(false);
cin>>Tlim;
dfs(0);
cout<
 
 Share Show Comments 【CodeForces 865G】Flowers and Chocolate / 题解 Origin 题目描述 Idea 待整理。。。 Code #include #define maxn 505 #define ll long… 09 Jul 2018 【CodeVS 1163】“访问”艺术馆（gallery）/ 题解 Origin Statement Peel was a famous pirate painter. After months of careful… 09 Jul 2018 
 
 
 Topics Thought: 30 Study: 26 Selected: 26 Zepto's © 2022 Sponsor Data & privacy Contact → Published with Ghost • Theme Attila • System theme 
 $(document).ready(function () { var viewport =$(window); var post = $('.post-content'); // Responsive videos with fitVids post.fitVids(); // Format code blocks and add line numbers function codestyling() {$('pre code').each(function(i, e) { // Code highlight hljs.highlightBlock(e); // No lines for plain text blocks if (!$(this).hasClass('language-text')) { var code =$(this); // Calculate amount of lines var lines = code.html().split(/\n(?!$)/g).length; var numbers = []; if (lines > 1) { lines++; } for (i = 1; i < lines; i++) { numbers += '<span class="line" aria-hidden="true">' + i + '</span>'; } code.parent().append('<div class="lines">' + numbers + '</div>'); } }); } codestyling(); // Reading progress bar on window top function readingProgress() { var postBottom = post.offset().top + post.height(); var viewportHeight = viewport.height(); var progress = 100 - (((postBottom - (viewport.scrollTop() + viewportHeight) + viewportHeight / 3) / (postBottom - viewportHeight + viewportHeight / 3)) * 100);$('.progress-bar').css('width', progress + '%'); (progress > 100) ? $('.progress-container').addClass('complete'):$('.progress-container').removeClass('complete'); } readingProgress(); // Trigger reading progress viewport.on({ 'scroll': function() { readingProgress(); }, 'resize': function() { readingProgress(); }, 'orientationchange': function() { readingProgress(); } }); // Check if disqus is defined by code injection if (typeof disqus === 'undefined') { // hide comment section $('.post-comments').css({ 'display': 'none' }); } else {$('#show-disqus').on('click', function() { $.ajax({ type: "GET", url: "//" + disqus + ".disqus.com/embed.js", dataType: "script", cache: true });$(this).parent().addClass('activated'); }); } });