All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Any order will do (Posted on 2005-07-12) Difficulty: 3 of 5
The numbers from 1 to 2n are separated into two lists of n numbers each, A and B; elements are ordered so a1<a2<...<an and b1>b2>...>bn.

How much is |a1-b1|+|a2-b2|+...+|an-bn|?

See The Solution Submitted by Federico Kereki    
Rating: 3.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts thoughts | Comment 1 of 8
the sum is somehere between n and n^2, depending on the sequences A and B.  n is the minimum, since ai and bi must differ by at least 1 each.  And n^2 is the maximum because the condition on A and B both inreasing means ai and bi can differ by at most n
  Posted by Josh70679 on 2005-07-12 16:51:52
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information