Envío 1732

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    int a[500001];
    int l[500001];
    int r[500001];
    bool ya = false;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        cin>>a[i];
        if(i==0) l[i] = a[i];
        else l[i] = l[i-1] + a[i];
    }

    for(int i = n-1; i >= 0; i--)
    {
        if(i==n-1) r[i] = a[n-1];
        else r[i] = r[i+1] + a[i];
    }

    /*cout<<endl;
    for(int i = 0; i < n; i++)
    {
        cout<<l[i]<<" --- "<<r[i]<<endl;
    }
    */
    
    for(int i = 0; i < n-1; i++)
    {
        if(l[i] > 0 && r[i+1] < 0)
        {
            cout<<i+1<<endl;
            ya = true;
            break;
        }
    }
    if(!ya) cout<<"Impossible"<<endl;
}