Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 0 KBi |
#2 |
Incorrecto
|
0.004 s | 3 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Incorrecto
|
0.003 s | 0 KBi |
#6 |
Incorrecto
|
0.091 s | 6 KBi |
#7 |
Correcto
|
0.025 s | 5 KBi |
#8 |
Correcto
|
0.049 s | 5 KBi |
#9 |
Incorrecto
|
0.098 s | 6 KBi |
#10 |
Incorrecto
|
0.054 s | 7 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 cnt = 0; int tc;cin>>tc; while(tc--){ int n;cin>>n; int nums[n]; REP(i,n)cin>>nums[i]; int last = 0; vi ans(n,-1); for(int i=n-1; i>=0; i--){ if(nums[i]>=last){ last = nums[i]; } else{ ans[i] = last; } } cnt++; cout<<"Case #"<<cnt<<": "; cout<<ans; } return 0; }