#include "secret.h"=
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
using namespace std;
int DP[1000][1000];
int segtree[4000];
int n;
int build(int l, int u, int i, int a[]){
if(l==u) return segtree[i] = a[l];
return segtree[i] = Secret(build(l, mid(l, u), lchild(i), a), build(mid(l, u)+1, u, rchild(i), a));
}
int query(int l, int u, int i, int ll, int uu){
if(l>=ll && u<=uu) return segtree[i];
if(l>mid(l, u)) return query(mid(l, u)+1, u, rchild(i), ll, uu);
if(u<=mid(l, u)) return query(l, mid(l, u), lchild(i), ll, uu);
return Secret(query(l, mid(l, u), lchild(i), ll, mid(l, u)), query(mid(l, u)+1, u, rchild(i), mid(l, u)+1, uu));
}
void Init(int N, int A[]){
n = N;
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++) DP[i][j] = -1;
}
build(0, n-1, 0, A);
}
int Query(int L, int R){
return query(0, n-1, 0, L, R);
}
//-2 4 5 5 6 8
//8 -2 6 4 5 5
//5 5 4 6 -2 8
Compilation message
secret.cpp:1:20: warning: extra tokens at end of #include directive
#include "secret.h"=
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
20088 ms |
4512 KB |
Time limit exceeded |
2 |
Execution timed out |
20073 ms |
4476 KB |
Time limit exceeded |
3 |
Execution timed out |
20019 ms |
4472 KB |
Time limit exceeded |
4 |
Execution timed out |
20060 ms |
8340 KB |
Time limit exceeded |
5 |
Execution timed out |
20045 ms |
8312 KB |
Time limit exceeded |
6 |
Execution timed out |
20022 ms |
8440 KB |
Time limit exceeded |
7 |
Execution timed out |
20055 ms |
8312 KB |
Time limit exceeded |
8 |
Execution timed out |
20090 ms |
8312 KB |
Time limit exceeded |
9 |
Execution timed out |
20044 ms |
8312 KB |
Time limit exceeded |
10 |
Execution timed out |
20007 ms |
8304 KB |
Time limit exceeded |