Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Incorrecto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Incorrecto
|
0.006 s | 1 KBi |
#6 |
Incorrecto
|
0.086 s | 7 KBi |
#7 |
Correcto
|
0.079 s | 6 KBi |
#8 |
Correcto
|
0.104 s | 6 KBi |
#9 |
Incorrecto
|
0.093 s | 6 KBi |
#10 |
Incorrecto
|
0.12 s | 8 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using vi=vector<int>; #define pb push_back typedef long long ll; int main(){ fast_io; int testcases; cin>>testcases; int t=testcases; while(testcases--){ cout<<"Case #"<<abs(t-testcases)<<":"; int n; cin>>n; vector<int> v(n); for(int i=0;i<n;i++) cin>>v[i]; vector<int> ans(n); int curh=v[n-1]; for(int i=n-1;i>-1;i--){ if(v[i]>=curh){ curh=v[i]; ans[i]=-1; }else{ ans[i]=curh; } } for(int i=0;i<n;i++){ cout<<" "<<ans[i]; } cout<<endl; } }