Buy one get one free - Zenefits


http://yuancrackcode.com/2015/10/23/buy-one-get-one-free/
一堆商品,买一个可以送一个,但送的那个的价格必须小于买的那个的价格(强调一下,不能等于)。给定商品总数n和每个商品的价格,求得到全部商品的最少开销。 例如:4个商品价格为[5, 4, 3, 3],最优解为9,即买5和4,送3和3。 
两个test case: [100, 99, 98, 1, 1, 1], [100, 99, 98, 98, 97, 97, 97, 97]
http://www.jiuzhang.com/qa/221/

这个题确实是很难的动态规划。属于区间型动态规划。在九章算法强化班中会讲到这个类型的动态规划。
首先排序不用说了。从小到大(从大到小也可以,我比较喜欢从小到大)。然后先给出DP的方程:
定义状态 f[i][j] 为 i 到 j 这一段的最优值(最少花多少钱全买下来)
    f[i][j] = min(f[i + 1][j - 1]+A[j], f[i][k] + f[k+1][j]) 其中k为i到j-1。
然后我们来证明为什么这个方程是对的。这个方程的假设前提是,不存在相交的搭配,也就是说不存在下面这种情况的匹配:
从小到大的4个数:a<= b<= c<= d。 a与c一起买,b与d一起买。
为毛呢?首先a和d肯定不相等,否则的话,abcd都相等了,这种情况是不会出现的(我们就是要证明这种情况不会出现),然后看b和c,如果他们相等,那么换成(a,b)和(c,d),代价一样,并且不会产生相交的匹配(什么叫做相交?你在ac连一条曲线,和bd之间的曲线一定相交)。然后看b和c不等的情况,不等的话,换成(b,c) + (a,d),也还是不影响结果=c+d, 然后又能使得连线不相交。
好了,上面我们证明了不相交理论。那么既然连线不想交的话,i-j这一段的匹配情况,只存在两种可能性:
  • 第一种可能是i和j匹配,然后中间的自己配对。
  • 第二种可能是,一定存在一条分割线,使得这个i-j的区间被分为i-k和k+1-j,两个区间之间的自己匹配,没有互相的连边。
好了,综上所述。问题已经解决并证明。我知道理解起来有点难,特别是证明,我也证明了好久……
顺便说一下时间复杂度 : O(n^3),可能可以用决策单调的优化优化到O(n^2)。
你可能要问我,我TMD是怎么想到这个解法的呢?因为课上讲过的DP就那么几种大类型……面试99%都落在 “划分/区间/矩阵/双序列/背包" 这五种类型。一个个试试看就行了……首先想到的是划分,然后发现推导不出来。然后矩阵肯定不是,双序列和背包也不是,只剩下区间了……
http://www.1point3acres.com/bbs/thread-143891-1-1.html
http://www.1point3acres.com/bbs/thread-143891-2-1.html
  1. int LeastCost(vector<int>& costs) {
  2.         int n = costs.size();. 1point 3acres 璁哄潧
  3.         if (n == 0)
  4.                 return 0;
  5.         sort(costs.begin(), costs.end());
  6.         vector<vector<int> > T(n, vector<int>(n, 0));. 涓€浜�-涓夊垎-鍦帮紝鐙鍙戝竷

  7.         for (int i = 0; i < n; i++)
  8.                 T[i][i] = costs[i];
  9.         for (int len = 2; len <= n; len++)
  10.                 for (int i = 0, j = i + len - 1; j < n; i++, j++) {. 鍥磋鎴戜滑@1point 3 acres
  11.                         T[i][j] = T[i][j-1] + costs[j];
  12.                         for (int k = i; k < j; k++) {
  13.                                 int p1 = costs[j], p2 = 0, p3 = 0;
  14.                                 if (costs[k] == costs[j])
  15.                                         p1 += costs[k];
  16.                                 if (k - 1 >= i)
  17.                                         p2 = T[i][k-1];
  18.                                 if (j - 1 >= k + 1). 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  19.                                         p3 = T[k+1][j-1];
  20.                                 if (p1 + p2 + p3 < T[i][j])
  21.                                         T[i][j] = p1 + p2 + p3;
  22.                         }
  23.                 }
  24.         return T[0][n - 1];
  25. }


Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts