Envío 2387

Código

#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0); cin.tie(0);
#define fore(i, a, b) for(int i = a; i < b; i++)
#define fori(i, a, b) for(int i = a; i <= b; i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define popb pop_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
#define MAX 200
typedef long long int lli;
typedef long double ld;

int main() {
    int cases, n;
    cin >> cases;
    vector <int> numbers;
    int left = 0, right = 0;

    while (cases--){
        cin >> n;
        numbers.push_back(n);
        right += n;
    }    

    int n_min = numbers.size() + 5;
    int index = numbers.size();

    for(int i=0;i<numbers.size();i++){
        left += numbers[i];
        right -= numbers[i];

        if(left > 0 && right < 0){
            index = (i+1);
            n_min = min(n_min, index);
        }
    }

    if(n_min != numbers.size() + 5) cout << n_min << endl;
    else cout << "Impossible" << endl;

	return 0;
}