Submission #64301534

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
# include <bits/stdc++.h>
using namespace std;
int n , t , r = 1 , cnt , maxn , a[110] , f[110];
int main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; i ++)
    {
        cin >> a[i];
    }
    cnt = n;
    while(cnt)
    {
        t = maxn = 0;
        for(int i = 1 ; i <= n ; i ++)
        {
            if(!f[i])
            {
                maxn = max(maxn , a[i]);
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

# include <bits/stdc++.h>
using namespace std;
int n , t , r = 1 , cnt , maxn , a[110] , f[110];
int main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; i ++)
    {
        cin >> a[i];
    }
    cnt = n;
    while(cnt)
    {
        t = maxn = 0;
        for(int i = 1 ; i <= n ; i ++)
        {
            if(!f[i])
            {
                maxn = max(maxn , a[i]);
            }
        }
        for(int i = 1 ; i <= n ; i ++)
        {
            if(a[i] == maxn)
            {
                f[i] = r;
                cnt --;
                t ++;
            }
        }
        r += t;
    }
    for(int i = 1 ; i <= n ; i ++)
    {
        cout << f[i] << "\n";
    }
    return 0;
}

Submission Info

Judge Result