Skip to main content

AppledoreM's Blog

Category: Minimum Cost Flow

P2153: Exercise [SDOI2009]

2018-06-252018-06-25 appledorem Leave a comment

Problem Description: There are N nodes and M edges, you can go through each node at most once, there are weights on the edges. Try to minimize the total weight going through 1 to N while maximizing the times you can go from 1 to N without passing through any nodes twice except node 1 […]

Read More

Counter Sama

  • 48264Total Views:
  • 33510Total Vistors:
  • 2018-06-25Counter Sama's Birthday:

Popular Posts

  • Introduction to Probability and Statistics: Chapter 2
  • Effective C++ : Chapter 4 Note
  • Codeforces Round 568 Div2 E, F, G Note
  • String Problems: KMP & Manacher Algorithms
  • Effective C++ : Chapter 5 Note
  • Codeforces Round514 Div2 D & E
  • Effective C++:Chapter 2 Note
  • AP European History Note
  • BZOJ-1002: Rotavirus [FJOI2007]
  • Introduction to Probability and Statistics: Chapter 1

Recent Posts

  • Effective C++ : Chapter 5 Note
  • Effective C++ : Chapter 4 Note
  • Effective C++:Chapter 3 Note
  • Effective C++:Chapter 2 Note
  • Effective C++:Chapter 1 Note

All Categories

AC Automaton AP European History AtCoder Bit Mask BZOJ C++ Codeforces DFS DP Effective C++ Third Edition Note Expectancy Graph Theory Greedy HDU Introduction To Probability and Statistics Introductory Combinatorics LuoGu Math Mathematics Maximum-Flow Minimum Cost Flow Miscellaneous Monotonic Queue Note OI SBT Spanning Tree Counting String Problem Suffix Arrary Tree DP

Friends

  • Menci
  • sparkling Theme by Colorlib Powered by WordPress
     

    Loading Comments...