Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Incorrecto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.007 s | 33 KBi |
#4 |
Correcto
|
0.004 s | 66 KBi |
#5 |
Incorrecto
|
0.005 s | 14 KBi |
#6 |
Correcto
|
0.003 s | 11 KBi |
#7 |
Correcto
|
0.004 s | 25 KBi |
#8 |
Correcto
|
0.003 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.004 s | 30 KBi |
#11 |
Correcto
|
0.008 s | 28 KBi |
#12 |
Incorrecto
|
0.005 s | 18 KBi |
#13 |
Incorrecto
|
0.004 s | 2 KBi |
#14 |
Incorrecto
|
0.018 s | 2 KBi |
#15 |
Incorrecto
|
0.016 s | 2 KBi |
#16 |
Correcto
|
0.045 s | 2 KBi |
#17 |
Incorrecto
|
0.047 s | 3 KBi |
#18 |
Correcto
|
0.014 s | 2 KBi |
#19 |
Correcto
|
0.05 s | 3 KBi |
#20 |
Incorrecto
|
0.018 s | 2 KBi |
#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]; REP(i,n)cin>>nums[i]; for(int i=n-2; i>=0; i--){ nums[i]+=nums[i+1]; } int ans = -1; for(int i=n-1; i>=0; i--){ if(nums[i]<0){ ans = i; } } //REP(i,n)cout<<nums[i]<<endl; if(ans!=-1 && ans!=0 && ans!=n-1)cout<<ans<<endl; else cout<<"Impossible"<<endl; return 0; }