Submission #316795

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Text;
using sc = Scanner;
using System.Collections;


class Program
{
    static void Main(string[] args)
    {
        int n = sc.NextInt();
        int k = sc.NextInt();
        PriorityQueue<int[]> ranking = new PriorityQueue<int[]>((a, b) => {return b[1]-a[1]; });
        int[] answer = {0,0}; 
        int[][] answerCollector = new int[n-k+1][];
        int indexAC = 0;
        for (int i = 0; i < k; i++)
        {
            ranking.Push(new int[]{ i + 1, sc.NextInt() });
        }
        answer = ranking.Pop();
        answerCollector[indexAC] = (int[])answer.Clone();
        indexAC++;
        for (int i = k; i < n; i++)
        {
            ranking.Push(new int[]{i+ 1,sc.NextInt()});
            int[] tmp = ranking.Pop();
            if (tmp[1] < answer[1])//次の候補者の方が若い
            {
                answer = tmp;

            }
            answerCollector[indexAC] = (int[])answer.Clone();
            indexAC++;
        }
        for (int i = 0; i < answerCollector.Length; i++)
        {
            Console.WriteLine(answerCollector[i][0]);
        }
    }
}

/// <summary>
/// ・一般的なデータ構造のオブジェクトT
/// ・Icomparableを持った「新たなクラスを生成すること無く」比較方法の動的化
/// を目的とした優先度付きキュー，comparison にCompareToを入れる
/// １回あたりの計算量はPop PushともにO(logn)
/// </summary>
/// <typeparam name="T"></typeparam>
class PriorityQueue<T>
{
    ArrayList array;

    public int Count { get{return array.Count;}}

    Comparison<T> comparison;

    /// <summary>
    /// コンストラクタ
    /// </summary>
    /// <param name="comparison">Tに対する比較方向を示すデリゲート, (a,b)のとき返り値intに a_int - b_int (a > b) なら昇順，逆なら降順</param>
    public PriorityQueue(Comparison<T> comparison)
    {
        this.comparison = comparison;
        array = new ArrayList();
    }

    /// <summary>
    /// ヒープ化されている配列リストに新しい要素を追加する。
    /// </summary>
    /// <param name="array">対象の配列リスト</param>
    private void PushHeap(T elem)
    {
        int n = array.Count;
        array.Add(elem);

        while (n != 0)
        {
            int i = (n - 1) / 2;
            // 親と値を入れ替え
            if (comparison((T)array[n], (T)array[i]) < 0)
            {
                T tmp = (T)array[n]; array[n] = array[i]; array[i] = tmp;
            }
            n = i;
        }
    }

    /// <summary>
    /// ヒープから指定した値を削除する。
    /// </summary>
    /// <param name="array">対象の配列リスト</param>
    private T PopHeap()
    {
        if (array.Count == 0)
            throw new IndexOutOfRangeException("要素が0のキューに要素を取り出す命令がおこなわれました");
        int n = array.Count - 1;
        T returnItem = (T)array[0];
        array[0] = array[n];
        array.RemoveAt(n);

        for (int i = 0, j; (j = 2 * i + 1) < n; )
        {
            // 値の大きい方の子を選ぶ
            if ((j != n - 1) && (comparison((T)array[j],(T)array[j+1]) > 0))
                j++;
            // 子と値を入れ替え
            if (comparison((T)array[i], (T)array[j]) > 0)
            {
                T tmp = (T)array[j]; array[j] = array[i]; array[i] = tmp;
            }
            i = j;
        }
        return returnItem;
    }





    /// <summary>
    /// 要素のプッシュ．
    /// </summary>
    /// <param name="elem">挿入したい要素</param>
    public void Push(T elem)
    {
        PushHeap(elem);
    }


    /// <summary>
    /// 要素をポップ．出したデータはコレクションの中から消える
    /// </summary>
    /// <returns></returns>
    public T Pop()
    {
        return PopHeap();
    }

    /// <summary>
    /// 要素を全て消去する
    /// </summary>
    public void Clear()
    {
        array.Clear();
    }
}



public static class Scanner
{
    public static string[] NextStrArray()
    {
        return Console.ReadLine().Split(' ');
    }

    public static long[] NextLongArray()
    {
        string[] s = NextStrArray();
        long[] a = new long[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = long.Parse(s[i]);
        }
        return a;
    }
    public static int[] NextIntArray()
    {

        string[] s = NextStrArray();
        int[] a = new int[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = int.Parse(s[i]);
        }
        return a;
    }
    public static int NextInt()
    {
        string tmp = "";
        while (true)
        {
            string readData = char.ConvertFromUtf32(Console.Read());
            if (readData == " " || readData == "\n")
                break;
            tmp += readData;
        }
        return int.Parse(tmp);
    }
    public static double NextDouble()
    {
        string tmp = "";
        while (true)
        {
            string readData = char.ConvertFromUtf32(Console.Read());
            if (readData == " " || readData == "\n")
                break;
            tmp += readData;
        }
        return double.Parse(tmp);
    }
    public static long NextLong()
    {
        string tmp = "";
        while (true)
        {
            string readData = char.ConvertFromUtf32(Console.Read());
            if (readData == " " || readData == "\n")
                break;
            tmp += readData;
        }
        return long.Parse(tmp);
    }
    public static double[] NextDoubleArray()
    {

        string[] s = NextStrArray();
        double[] a = new double[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = double.Parse(s[i]);
        }
        return a;
    }
}

Submission Info

Judge Result