Envío 6831

Código

#include <bits/stdc++.h>

const int max = 1e6;

long long A[max];
long long S[max];

using namespace std;


int main() {
    long long N;
    cin>>N;

    for (int i = 1; i <= N; ++i) {
        cin>>A[i];
    }

    for (int i = 1; i <= N; ++i) {
        S[i] = S[i-1] + A[i];
    }
    int ans = 0;
    bool vand = false;

    for (int i = 1; i <= N; ++i) {
        if( (S[i] - S[0] > 0) && (S[N] - S[i]<0)){
            ans = i;
            vand = true;
            break;
        }
    }

    if(vand)
        cout<<ans;
    else
        cout<<"Impossible";

    return 0;
}