On a map where each point on the map is given a value then is finding the n non-overlapping submaps to minimize the range of sums known to be P or NP?

Question

To be more specific because of the character limit : "If there is a continuous graph where each vertex on the graph is assigned a positive integer value then is the goal of finding the n continuous non-overlapping subgraph that minimize the range of sums of the vertices of the subgraph known to P or NP for 1<n<# of vertices" Here is an example graph: https://www.desmos.com/geometry/zfklxdlnew In that graph there are 3 subgraphs that minimize the range, totaling to 18, 20 and 19 with a range of 3. All vertices in the graph must be included in 1 and only of the subgraphs.