greedy

I have a string 'CCCC' and I want to match 'CCC' in it, with overlap. My code: ... std::string input_seq = "CCCC"; std::regex re("CCC"); std::sregex_iterator next(input_seq.begin(), input_seq.end(), re); std::sregex_iterator end; while (next != end) { std::smatch match = *next; std::cout << match.str() << "\t" << "\t" << match.position() << "\t" << "\n"; next++; } ... However this only returns CCC 0 and skips the CCC 1 solution, which is needed for me. I read about non-greedy '?' matching, but I could not make it work Your regex can be put into the capturing parentheses that can be wrapped

I understand how the greedy algorithm for the coin change problem (pay a specific amount with the minimal possible number of coins) works - it always selects the coin with the largest denomination not exceeding the remaining sum - and that it always finds the correct solution for specific coin sets. But for some coin sets, there are sums for which the greedy algorithm fails. For example, for the set {1, 15, 25} and the sum 30, the greedy algorithm first chooses 25, leaving a remainder of 5, and then five 1s for a total of six coins. But the solution with the minimal number of coins is to

Does the opposite of Kruskal's algorithm for minimum spanning tree work for it? I mean, choosing the max weight (edge) every step? Any other idea to find maximum spanning tree? systemkern Yes, it does. One method for computing the maximum weight spanning tree of a network G – due to Kruskal – can be summarized as follows. Sort the edges of G into decreasing order by weight. Let T be the set of edges comprising the maximum weight spanning tree. Set T = ∅. Add the first edge to T. Add the next edge to T if and only if it does not form a cycle in T. If there are no remaining edges exit and report