Submission #419691

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
419691	2021-06-07T11:39:02 Z	Sasha008	Financial Report (JOI21_financial)	C++17	0 / 100	31 ms	6684 KB

Main

#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,n,m,g,i,j,k0,k1,k2,k3,f,k,l,r,o,p,t,y,mx=-1e18,mx1=-1e18,mx2=-1e18,q,q1,q2,mn=1e18,mn1=1e18,mn2=1e18,INF=1e18;
long long A[200005];
long long dp[200005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>d;
    for(i=1;i<=n;i++)
    {
        cin>>A[i];
    }
    for(i=1;i<=n;i++)
    {
        if (n<=7000||d==1)
        {
            f=max(a-a+1,i-d);
            mx2=-1e18;
            for(j=i-1;j>=f;j--)
            {
                if (A[i]>A[j]) dp[i]=max(dp[i],dp[j]+1);
            }
            dp[i]=max(dp[i],1ll);
            mx=max(mx,dp[i]);
        }
        else
        {

        }
    }
    cout<<mx;
}
//10 1
//1 1 2 2 2 2 2 2 3 3

//numeric_limits<long long>::3min()

Subtask #1

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	29 ms	6684 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	31 ms	1828 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-