LA 2678: Subsequence

-

LA 2678: Sub-sequence

Problem Statement


Analysis

    We are asked to find the length of the shortest sub-sequence such that the sum of all elements in it is at least S. In other words, given the array A_0 ~ A_N-1, find the smallest possible X such that there exists a i which satisfies ∑A_j ≥ S, where j = i ~ i + X - 1.
    For example, when A = [1, 2, 3, 4, 5], N = 5, and S = 11, the smallest possible X is 3 and the i is 2. This is sample test case 2.

Algorithm: O(N^3)

    The most naive method is to permute through all possible sub-sequence beginnings and ends.
There are N beginnings and N/2 ends on average, making just permuting through possible sub-sequences O(N^2). Multiplying by the cost of finding the sum of that sub-sequence, O(N), gives us a total O(N^3) algorithm. Clearly that will not work!

Algorithm: O(N^2)

    However, we can use a prefix sum to improve on the cost of finding the sum of that sub-sequence. During reading the input of an element the i-th element, say its value is V[i], let the prefix sum value of the i-th element be as follows:
S[i] = S[i-1] + V[i].
Sure enough, this shortens the O(N) cost of finding the sum to O(1), but we are left with O(N^2) - still to slow.

Algorithm: O(N log N)

    This algorithm also requires to use prefix sums. We can binary search for the smallest possible X. 
The search space satisfies the property for binary search:
The search space, 0 to N, must satisfy the property that if i is "doable" (doable being a binary predicate), i+1 must also be doable, and if i is not doable, i-1 must also be not doable. 
How? The sequence, A, is guaranteed to be positive. Therefore, for any sub-sequence, extending it will only increase its sum, and shortening it will only decrease its sum.

We can verify if this X is "doable" in O(N) - for each i from X to N - 1, find S[i] - S[i - X]. S is the array described above. If that value is greater than S, then X is doable, else, try a different i. If for no i is S[i] - S[i - X] greater than S, X is not doable. This O(N log N) approach definitely works - but can we do better?

Algorithm: O(N)

    How about only permuting the end, and find the last possible i such that the i-th element through the end of the sub-sequence has sum S? The larger i is, the better the solution. Furthermore, the best i for any end of the sub-sequence can only get bigger - never smaller. Therefore, this method is O(N) - just enough.

Code

Algorithm: O(N log N)

#include <cstring>
#include <iostream>
#define MAXN 100005
using namespace std;

 int psum[MAXN], N, S;

 bool doable(int X)
{
for(int i=X; i<=N; i++)
if(psum[i] - psum[i-X] >= S) return true;
return false;
}

 int main()
{
ios_base::sync_with_stdio(false); cin.tie(nullptr);
while(cin >> N >> S)
{
memset(psum, 0, sizeof psum);
for(int i=1; i<=N; i++)
{
int x;
cin >> x;
psum[i] = psum[i-1] + x;
}
if(psum[N] < S)
{
cout << 0 << endl;
continue;
}
int l = 1, r = N;
while(l < r)
{
int m = (l + r)/2;
if(doable(m)) r = m;
else l = m + 1;
}
cout << r << endl;
}
}

Algorithm: O(N)


#include <cstring>

#include <iostream>
#define MAXN 100005
using namespace std;

int psum[MAXN];

int main()
{
int N, S;
ios_base::sync_with_stdio(false);
while(cin >> N >> S)
{
memset(psum, 0, sizeof psum);
for(int i=1; i<=N; i++)
{
int x;
cin >> x;
psum[i] = psum[i-1] + x;
}
int ans=MAXN, i=1;
for(int e=1; e<=N; e++)
{
if(S > psum[e]) continue;
while(psum[i] <= psum[e] - S) i++;
ans = min(ans, e - i + 1);
}
cout << (ans == MAXN ? 0 : ans) << endl;
}
}

Comments

Post a Comment

Popular posts from this blog

USACO Training "subset": Subset Sums

-
USACO Training "subset": Subset Sums Problem Statement Subset Sums JRM For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical. For example, if N=3, one can partition the set {1, 2, 3} in one way so that the sums of both subsets are identical: {3} and {1,2} This counts as a single partitioning (i.e., reversing the order counts as the same partitioning and thus does not increase the count of partitions). If N=7, there are four ways to partition the set {1, 2, 3, ... 7} so that each partition has the same sum: {1,6,7} and {2,3,4,5} {2,5,7} and {1,3,4,6} {3,4,7} and {1,2,5,6} {1,2,4,7} and {3,5,6} Given N, your program should print the number of ways a set containing the integers from 1 through N can be partitioned into two sets whose sums are identical. Print 0 if there are no such ways. Your program must calculate the answer, not look it up from a table. PROGRAM NAME: s
Read more

USACO 2018 Open: Talent Show

-
Image
USACO 2018 Open Talent Show In Short Given N objects with value Vi and weight Wi, a collection of elements is said to have total value-to-weight ratio as (the sum of their value) divided by (the sum of their weight). Find the best possible value-to-weight ratio of these X objects, given the restraint that the collection must have total weight at least W. Return that ratio multiplied by 1000 and floored. Analysis It would be very difficult to calculate this optimal ratio - we'd have to either try all possible collections - O(2^n), where n is at most 250, about 10 to the power of 75 calculations, OR use a greedy heuristic - get the objects with the best ratio until it satisfies the weight limit. Neither of those are too to our liking, so how about searching for it? The search space is linear and not infinite - it asks for the ratio to the closest thousandths. The search space is sorted as well - if ratio X is achievable, then ratio Y < X is also achievable, if
Read more

OpenJudge 1768: Kadane's Algorithm on 2D Arrays

-
OpenJudge 1768: Kadane's Algorithm on 2-D Arrays Simple Version Given a 2-D matrix of integers, find the sub-matrix of this whose sum is maximized, and find that sum. The size of the matrix is no larger than 100 by 100. Analysis O(N^4) - Works, but naive     That's true, an naive O(N^4) version would work. We simply need to calculate (two dimensional!) prefix sums first. A quick review to what 2-D prefix sums are:     The 2-D prefix sum of two coordinates, X and Y, is the sum of all elements that have X-coordinate less than or equal to X, and Y coordinate less than or equal to Y.     It can be calculated through tabulation by removing overlapping areas.     Let P be the prefix sum array and V be the array of values, so the formula is as follows:     P[x, y] = V[x, y] - P[x-1, y] - P[x, y-1] + P[x-1, y-1].     We need to add the P[x-1, y-1] at the end since subtracting P[x-1, y] and P[x, y-1] we had overlapped the P[x-1, y-1]. Then, all we need to
Read more