Envío 615

Código

// https://codeo.app/problemas/0xf2-partir-un-arreglo-en-2

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, partitionIndex, sum;
    vector<int> arr;

    // Read inputs
    cin >> n;
    arr = vector<int>(n);
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }

    // Calculate index to which array is split and right part sum is negative
    partitionIndex = n;
    sum = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        sum += arr[i];
        // ignores first element to make partition possible
        if (sum < 0)
        {
            partitionIndex = i;
        }
    }

    // Output
    if (partitionIndex == n)
    {
        cout << "Impossible" << endl;
    }
    else
    {
        cout << partitionIndex << endl;
    }

    return 0;
}