#include<bits/stdc++.h>
#include "popa.h"
using namespace std;
/*
int query(int a , int b , int l , int r){
int k =s[a];
for(int i = a+1; i<= b; ++i)k = __gcd(k , s[i]);
int j = s[l];
for(int i = l + 1; i <= r; ++i)j = __gcd(j , s[i]);
return k == j;
}
*/
int solve(int n , int *Left , int *Right) {
stack<int> st;
int root = 0;
for(int i = 0; i < n; ++i)Left[i] = Right[i] = -1;
st.push(0);
for(int i =1; i < n; ++i){
while(st.size() && query(st.top() , i , i , i)){
Right[st.top()] = Left[i];
Left[i] = st.top();
st.pop();
}
if(st.size()) Right[st.top()] = i;
else root = i;
}
return root;
}
/*
int main (){
int n;
cin >> n;
for(int i = 0; i< n; ++i)cin >> s[i];
memset(Left , -1 , sizeof(Left));memset(Right , -1 , sizeof(Right));
cout << solve(n)<<endl;
for(int i = 0; i < n; ++i)cout << Left[i] << " " << Right[i] << endl;
}
*/
///20 80 40
///40 80 20
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
328 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
284 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
276 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |