Advertisement
Ahmed_Negm

Untitled

Jul 22nd, 2022
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.89 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ll long long
  5. #define ull unsigned long long
  6. #define nl '\n'
  7. #define sz(x) int(x.size())
  8. #define all(x) x.begin(),x.end()
  9. #define rall(s)  s.rbegin(), s.rend()
  10. #define getline(s) getline(cin>>ws,s)
  11. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  12. #define pi  3.141592653589793
  13.  
  14. /*
  15. ███╗░░██╗███████╗░██████╗░███╗░░░███╗
  16. ████╗░██║██╔════╝██╔════╝░████╗░████║
  17. ██╔██╗██║█████╗░░██║░░██╗░██╔████╔██║
  18. ██║╚████║██╔══╝░░██║░░╚██╗██║╚██╔╝██║
  19. ██║░╚███║███████╗╚██████╔╝██║░╚═╝░██║
  20. ╚═╝░░╚══╝╚══════╝░╚═════╝░╚═╝░░░░░╚═╝
  21.  
  22. */
  23.  
  24. void Fast_IO(){
  25. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  26. // freopen("filename.in", "r", stdin), freopen("filename.txt", "w", stdout);
  27. #ifndef ONLINE_JUDGE
  28. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  29. #endif
  30. }
  31.  
  32.  
  33.  
  34.  
  35.  
  36. void solve(){
  37.   ll n; cin>>n;
  38.   vector<ll>v;
  39.   for(int i=1; i<=n; i++){
  40.       ll x; cin>>x;
  41.       v.push_back(x);
  42.   }
  43.   vector<ll>res;
  44.     while(1){
  45.     ll maxe = *max_element(all(v));
  46.         if(maxe==0) break;
  47.         for(int i=0; i<n; i++){
  48.         if(v[i]==maxe){
  49.         res.push_back(i+1);
  50.         v[i]--;
  51.         break;
  52.         }
  53.         }
  54.  
  55.     }
  56.     for(int i=1; i<sz(res); i++){
  57.         if(res[i] == res[i-1]) return void(cout<<"-1");
  58.     }
  59.     for(auto&i:res) cout<<i<<' ';
  60.  
  61.  
  62.  
  63.  
  64.  
  65.     }
  66.  
  67. int main(){
  68.     Fast_IO();
  69. int t =1;
  70. //cin>>t;
  71. while(t--){
  72. solve();
  73. }
  74. return 0;
  75. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement