oj.uz

Submission #851740

# Submission time Handle Problem Language Result Execution time Memory
851740 2023-09-20T14:03:49 Z Trumling Financial Report (JOI21_financial) C++14
12 / 100
 34 ms 6740 KB 
#include<bits/stdc++.h>
using namespace std;
    
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 999999999999
ll MOD=1000000006;
#define round fixed<<setprecision(2)<<
#define all(x) x.begin(),x.end()


int main()
{

ios_base::sync_with_stdio(0);
cin.tie(0);

ll n,d;
cin>>n>>d;

ll arr[n];
for(int i=0;i<n;i++)
    cin>>arr[i];

ll ans=0;
deque<int>dq;

for(int i=n-1;i>=0;i--)
{
    while(!dq.empty() && dq.front()<=arr[i])
        dq.pop_front();

    dq.push_front(arr[i]);

    ans=max(ans,(ll)dq.size());
}
cout<<ans;

}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2908 KB Output is correct
2 Correct 27 ms 2652 KB Output is correct
3 Correct 25 ms 2652 KB Output is correct
4 Correct 26 ms 5580 KB Output is correct
5 Correct 26 ms 5460 KB Output is correct
6 Correct 28 ms 5472 KB Output is correct
7 Correct 25 ms 6740 KB Output is correct
8 Correct 29 ms 5572 KB Output is correct
9 Correct 25 ms 6484 KB Output is correct
10 Correct 27 ms 5468 KB Output is correct
11 Correct 27 ms 5456 KB Output is correct
12 Correct 28 ms 5456 KB Output is correct
13 Correct 25 ms 5468 KB Output is correct
14 Correct 25 ms 5588 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2796 KB Output is correct
2 Incorrect 26 ms 2780 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

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