import java.io.*;
import java.util.*;
class tea{
static int INF=(int)1e9;
static Integer[]indices;
static int n,a[];
static int ceiling(ArrayList<Integer> cand2,int x,int lo) {
int hi=cand2.size()-1;
int ans=-1;
while(lo<=hi) {
int mid=lo+hi>>1;
int idx=cand2.get(mid);
if(idx>=x) {
ans=idx;
lo=mid+1;
}
else
hi=mid-1;
}
return ans;
}
static int[][] check(int limit) {
int []dp=new int [n+1]; //number of teams
int []nxt=new int [n+1];
Deque<Integer> queue=new LinkedList();
ArrayList<Integer> cand2=new ArrayList();
int lo=0;
cand2.add(n);
queue.add(n);
for(int i=n-1;i>=0;i--) {
int x=a[indices[i]];
if(i+x>n)
continue;
while(!queue.isEmpty()) {
int j=queue.peekFirst();
if(j-i>limit) {
queue.removeFirst();
lo++;
}
else
break;
}
// Integer first=cand.ceiling(i+x);
int first=ceiling(cand2,i+x,lo);
if(first==-1)
continue;
dp[i]=dp[first]+1;
nxt[i]=first;
if(dp[i]>=dp[queue.peekLast()]) {
queue.addLast(i);
cand2.add(i);
}
//
}
int [][]ans=new int [2][n];
ans[0]=dp;
ans[1]=nxt;
return ans;
}
public static void main(String[] args) throws IOException {
InputReader sc=new InputReader(System.in);
PrintWriter out=new PrintWriter(System.out);
n=sc.nextInt();
indices=new Integer[n];
a=new int [n];
for(int i=0;i<n;i++) {
a[i]=sc.nextInt();
indices[i]=i;
}
Arrays.sort(indices,Comparator.comparingInt(i->-a[i]));
int [][]x;
x=check(n);
int maxTeams=x[0][0];
int best=-1;
int lo=1,hi=n;
while(lo<=hi) {
int mid=lo+hi>>1;
x=check(mid);
if(x[0][0]==maxTeams) {
hi=mid-1;
best=mid;
}
else
lo=mid+1;
}
x=check(best);
int []dp=x[0];
int []nxt=x[1];
out.println(dp[0]);
Queue list=new Queue();
for(int i=0;i<n;) {
//
int j=nxt[i];
while(i<j) {
list.add(indices[i]+1);
i++;
}
out.print(list.size);
while(!list.isEmpty())
out.print(" "+list.poll());
out.println();
}
out.close();
}
static class Queue
{
int back,front;
int []a;
int size=0;
public Queue()
{
a=new int [n];
}
public int poll()
{
size--;
return a[back++];
}
public void add(int x)
{
size++;
a[front++]=x;
}
public boolean isEmpty()
{
return size==0;
}
}
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private InputReader.SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
}
Compilation message
Note: tea.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
172 ms |
14628 KB |
Output is correct |
| 2 |
Correct |
184 ms |
15812 KB |
Output is correct |
| 3 |
Correct |
339 ms |
15120 KB |
Output is correct |
| 4 |
Correct |
214 ms |
14896 KB |
Output is correct |
| 5 |
Correct |
205 ms |
15628 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
182 ms |
15844 KB |
Output is correct |
| 2 |
Correct |
190 ms |
15624 KB |
Output is correct |
| 3 |
Correct |
178 ms |
15380 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
215 ms |
15276 KB |
Output is correct |
| 2 |
Correct |
198 ms |
15588 KB |
Output is correct |
| 3 |
Correct |
195 ms |
15464 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
245 ms |
20700 KB |
Output is correct |
| 2 |
Correct |
258 ms |
22644 KB |
Output is correct |
| 3 |
Correct |
281 ms |
23176 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
270 ms |
21972 KB |
Output is correct |
| 2 |
Correct |
270 ms |
19832 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
857 ms |
58256 KB |
Output is correct |
| 2 |
Correct |
779 ms |
92864 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
938 ms |
78784 KB |
Output is correct |
| 2 |
Correct |
819 ms |
83856 KB |
Output is correct |
| 3 |
Correct |
807 ms |
80468 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
2731 ms |
191616 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
2576 ms |
168276 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
2859 ms |
162172 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
