제출 #1056888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056888		cpdreamer	Financial Report (JOI21_financial)	C++14	48 / 100	281 ms	642864 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define V vector
#define P pair
#define S second
#define F first
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7

void file(){
    freopen("input.txt.txt","r",stdin);
    freopen("output.txt.txt","w",stdout);
}
void file(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
void modify(int &a,int v1,int v2){
    if(a==-1)
        a=max(v1,v2);
    else
        a=min(a,max(v1,v2));
}
bool dp[8000][8000];
int minimum [8000][8000];
void solve() {
    int n;
    cin>>n;
    int d;
    cin>>d;
    int A[n];
    for(int i=0;i<n;i++)
        cin>>A[i];
    V<int>vp;
    for(int i=0;i<n;i++)
        vp.pb(A[i]);
    sort(all(vp));
    auto it=unique(all(vp));
    vp.resize(distance(vp.begin(),it));
    map<int,int>mp;
    for(int i=0;i<vp.size();i++)
        mp[vp[i]]=i;
    memset(dp,false,sizeof(dp));
    for(int j=0;j<n;j++) {
        for (int i = 0; i + j < n; i++) {
            if (j == 0)
                minimum[i][i + j] = A[i];
            else
                minimum[i][i + j] = min(A[i], minimum[i + 1][i + j]);
        }
    }
    for(int i=0;i<n-1;i++){
        int maxd=INT_MIN;
        for(int j=i+1;j<n;j++){
            int num_ele=j-i-1;
            if(num_ele<d)
                dp[i][j]=true;
            else{
                maxd=max(maxd,minimum[j-d][j-1]);
                if(maxd<=A[i])
                    dp[i][j]=true;
                else
                    dp[i][j]=false;
            }

        }
    }
    int dp1[n];
    for(int i=0;i<n;i++)dp1[i]=1;
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            if(dp[j][i] && A[i]>A[j]){
                dp1[i]=max(dp1[i],dp1[j]+1);
            }
        }
    }
    int ans=1;
    for(int i=0;i<n;i++)
        ans=max(ans,dp1[i]);
    cout<<ans<<endl;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //file();
    solve();
    return 0;
}

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

Main.cpp: In function 'void solve()':
Main.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0;i<vp.size();i++)
      |                 ~^~~~~~~~~~
Main.cpp: In function 'void file()':
Main.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen("input.txt.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen("output.txt.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void file(std::string)':
Main.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: At global scope:
Main.cpp:15:12: warning: 'called' defined but not used [-Wunused-variable]
   15 | static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7
      |            ^~~~~~

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