53C - Little Frog - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int arr[n] , t[n + 1];
    for (int i = 0 ; i < n + 1 ; i++)
    {
        t[i]=0;
    }
    arr[0]=1;
    t[1]++;
    int c = n - 1;
    for (int i = 1 ; i < n ; i++)
    {
        if (arr[i-1]+c <= n && t[arr[i-1]+c] == 0)
        {
            arr[i] = arr[i-1]+c;
            t[arr[i]]++;
        }
        else if (arr[i-1]-c >0 && t[arr[i-1]- c] == 0)
        {
            arr[i]= arr[i-1]-c;
            t[arr[i]]++;
        }
        c--;
    }
    for (int i = 0 ; i < n ; i++)
    {
        cout << arr[i] <<" ";
    }

}