# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200611 | 2020-02-07T15:26:54 Z | TadijaSebez | Editor (BOI15_edi) | C++11 | 1099 ms | 3704 KB |
#include <bits/stdc++.h> using namespace std; const int N=300050; int a[N]; int main(){ int n,mn=0; scanf("%i",&n); for(int i=1;i<=n;i++)scanf("%i",&a[i]),mn=min(mn,a[i]); for(int i=1;i<=n;i++){ stack<int> stk; int ans=0; if(i!=n&&mn>=-1&&n>5000){ for(int j=i;j>=1;j--){ if(stk.size()&&a[j]>stk.top()){ stk.pop(); }else{ if(a[j]>0){ans=a[j];break;} stk.push(a[j]); } } } printf("%i\n",ans); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1099 ms | 3704 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 59 ms | 1272 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |