Envío 5490

Código

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<n;i++)
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<endl;
    return os;
}
const lli mod=(1e9)+7;
const int N = 1e4+1;
int main(){
    fast_io;
    int n;cin>>n;
    int nums[n];
    int pre[n];
    REP(i,n)cin>>nums[i],pre[i] = nums[i];
    for(int i=n-2; i>=0; i--){
        nums[i]+=nums[i+1];
    }
    for(int i=1; i<n; i++){
        pre[i]+=pre[i-1];
    }
    int ans = -1;
    for(int i=n-1; i>0; i--){
        if(nums[i]<0 && pre[i-1]>0){
            ans = i;
        }
    }
    //REP(i,n)cout<<nums[i]<<" ";
    //cout<<endl;
    //REP(i,n)cout<<pre[i]<<" ";
    //cout<<endl;
    //cout<<"ans "<<ans<<endl;
    if(ans!=-1)cout<<ans<<endl;
    else cout<<"Impossible"<<endl;
    return 0;
}