제출 #420592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420592		schse	Financial Report (JOI21_financial)	C++17	48 / 100	4075 ms	3788 KiB

Main

#include <bits/stdc++.h>
#define INF INT32_MAX
using namespace std;

int main()
{
    vector<int> arr;
    int N, D;
    cin >> N >> D;
    vector<int> biggest(N + 2, INF);
    vector<int> lastindex(N + 2, -1);

    arr.resize(N);
    for (int &i : arr)
        cin >> i;

    for (int index = 0; index < N; index++)
    {
        int val = arr[index];
        biggest[0] = -1;
        lastindex[0] = index;
        for (int i = 1; i < lastindex.size(); i++) // nicht mehr aktuelles löschen
        {
            if (lastindex[i] < index - D)
                biggest[i] = INF;
        }

        for (int e = 0; e < biggest.size(); e++) // ablaufsdatum updaten
            if (biggest[e] >= val)
                lastindex[e] = index;

        for (int i = 0; i < biggest.size() - 1; i++) //
        {
            if (biggest[i] < val && val < biggest[i + 1])
            {
                biggest[i + 1] = val;
                lastindex[i + 1] = index;
            }
        }
    }
    int t = biggest.size() - 1;
    while (biggest[t] == INF)
        t--;
    cout << t;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:22:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for (int i = 1; i < lastindex.size(); i++) // nicht mehr aktuelles löschen
      |                         ~~^~~~~~~~~~~~~~~~~~
Main.cpp:28:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for (int e = 0; e < biggest.size(); e++) // ablaufsdatum updaten
      |                         ~~^~~~~~~~~~~~~~~~
Main.cpp:32:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for (int i = 0; i < biggest.size() - 1; i++) //
      |                         ~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35