oj.uz

답안 #68717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68717 2018-08-18T08:57:00 Z imsifile 박스런 (FXCUP3_box) C++
100 / 100
 222 ms 5440 KB 
#include<stdio.h>

int N, stk[505050][2], scn, dap[505050];

int main(){
	scanf("%d", &N);
	for(int i=1; i<=N; i++) dap[i]=-1;
	stk[scn][0]=1<<30, stk[scn++][1]=-1;
	for(int i=0; i<N; i++){
		int a; scanf("%d", &a);
		while(scn){
			if(stk[scn-1][0] >= a) break;
			scn--;
			if(!scn) break;
			int sz = i-stk[scn-1][1]-1;
			if(dap[sz]<0) dap[sz]=i-sz+1;
		}
		stk[scn][0]=a, stk[scn][1]=i;
		scn++;
	}
	int fl=0;
	for(int i=N; i>=1; i--){
		if(!fl){
			if(dap[i]>=0) fl=1;
			continue;
		}
		if(dap[i]<0 || dap[i]>dap[i+1]+1) dap[i]=dap[i+1]+1;
	}
	for(int i=1; i<=N; i++){
		printf("%d", dap[i]);
		if(i<N) printf(" ");
	}
	puts("");
	return 0;
}

Compilation message

box.cpp: In function 'int main()':
box.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
box.cpp:10:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a; scanf("%d", &a);
          ~~~~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 516 KB Output is correct
8 Correct 2 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct

Subtask #2
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 516 KB Output is correct
8 Correct 2 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 516 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 3 ms 516 KB Output is correct
13 Correct 3 ms 592 KB Output is correct
14 Correct 15 ms 852 KB Output is correct
15 Correct 27 ms 1276 KB Output is correct
16 Correct 31 ms 1496 KB Output is correct
17 Correct 87 ms 2956 KB Output is correct
18 Correct 125 ms 3612 KB Output is correct
19 Correct 149 ms 4700 KB Output is correct
20 Correct 206 ms 5440 KB Output is correct
21 Correct 222 ms 5440 KB Output is correct