답안 #1096691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096691 2024-10-05T02:29:43 Z DanITK13 3단 점프 (JOI19_jumps) C++14
5 / 100
4000 ms 3676 KB
//Code Le Van Quan, ma fix lai

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define endl "\n"
#define F first
#define S second
 
const ll ool=1e18;
const int ooi=1e9;
const int MOD=1e9+7;
const int N=5e5;
 
int n,m;
int a[N+5],x[N+5];
 
void subtask1(int l,int r) // O(n*n)
{
    ll ans=0;
    for (int i=1;i<=n;i++) x[i]=0;
    for (int i=r;i>=l;i--) x[i]=max(x[i+1],a[i]);
    for (int i=l;i<r-1;i++)
        for (int j=i+1;j<r;j++)
            ans=max(ans,1LL*x[j-i+j]+a[i]+a[j]);
    cout<<ans<<endl;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    
 
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i];
    cin>>m;
    for (int i=1;i<=m;i++)
    {
        int l,r; cin>>l>>r;
        subtask1(l, r);
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 4038 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4043 ms 3676 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 4038 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -