Submission #847541

#	Time	Username	Problem	Language	Result	Execution time	Memory
847541		Mr_Ph	Financial Report (JOI21_financial)	C++14	0 / 100	561 ms	1039432 KiB

Main

///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
int n,d;
vi arr;
int dp[402][402][402];
int ans(int idx,int prv,int prv1)
{
    if(idx==n)return 0;
    if(dp[idx][prv][prv1]!=-1)return dp[idx][prv][prv1];
    int e=ans(idx+1,(arr[idx]>arr[prv]?idx:prv1),idx)+(arr[idx]>arr[prv]);
    if((idx-prv1<d&&prv!=n-1)||(prv1==n))
        e=max(e,ans(idx+1,prv,prv1));
    return dp[idx][prv][prv1]=e;
}
void preprocess() {}
void solve()
{
   cin>>n>>d;
   memset(dp,-1,sizeof dp);
   arr.resize(n);
   ent(arr);
   arr.push_back(-1e9);
   cout<<ans(0,n,0)<<endl;
}
signed main()
{
    // freopen("div7.in","r",stdin);
    //freopen("div7.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:18:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
Main.cpp:41:4: note: in expansion of macro 'ent'
   41 |    ent(arr);
      |    ^~~

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