import java.util.*;
// Xenny And Question
class TestClass {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s = new Scanner(System.in);
int q, i, j, k=0, cnt;
q = s.nextInt();
int a[] = new int[q];
for (i = 0; i < q; i++)
{
a[i]=s.nextInt();
}
mergesort(a,0,q-1);
int max=Integer.MAX_VALUE;
for (i = 0; i < q; i++)
{
if(a[i]<max)
max=a[i];
}
cnt=a.length;
while(cnt>0)
{
System.out.println(cnt);
k=0;
cnt=a.length;
for (i = 0; i < q; i++)
{
if(a[i]!=0)
a[i]-=max;
}
for (i = 0; i < q; i++)
{
if(a[i]==0)
k++;
else
{
max=a[i];
i=q;
}
}
cnt-=k;
}
}
private static void mergesort(int[] arr,int l, int r) {
if(l<r)
{
int m = l+(r-l)/2; //Same as (l+r)/2, but avoids overflow for large
mergesort(arr, l, m);
mergesort(arr, m+1, r);
merge(arr, l, m, r);
}
}
private static void merge(int[] arr, int l, int m, int r) {
// TODO Auto-generated method stub
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */
int L[] = new int[n1];
int R[] = new int[n2];
/* Copy data to temp arrays L[] and R[] */
for(i = 0; i < n1; i++)
L[i] = arr[l + i];
for(j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy the remaining elements of L[], if there are any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy the remaining elements of R[], if there are any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
}
// Xenny And Question
class TestClass {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s = new Scanner(System.in);
int q, i, j, k=0, cnt;
q = s.nextInt();
int a[] = new int[q];
for (i = 0; i < q; i++)
{
a[i]=s.nextInt();
}
mergesort(a,0,q-1);
int max=Integer.MAX_VALUE;
for (i = 0; i < q; i++)
{
if(a[i]<max)
max=a[i];
}
cnt=a.length;
while(cnt>0)
{
System.out.println(cnt);
k=0;
cnt=a.length;
for (i = 0; i < q; i++)
{
if(a[i]!=0)
a[i]-=max;
}
for (i = 0; i < q; i++)
{
if(a[i]==0)
k++;
else
{
max=a[i];
i=q;
}
}
cnt-=k;
}
}
private static void mergesort(int[] arr,int l, int r) {
if(l<r)
{
int m = l+(r-l)/2; //Same as (l+r)/2, but avoids overflow for large
mergesort(arr, l, m);
mergesort(arr, m+1, r);
merge(arr, l, m, r);
}
}
private static void merge(int[] arr, int l, int m, int r) {
// TODO Auto-generated method stub
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */
int L[] = new int[n1];
int R[] = new int[n2];
/* Copy data to temp arrays L[] and R[] */
for(i = 0; i < n1; i++)
L[i] = arr[l + i];
for(j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy the remaining elements of L[], if there are any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy the remaining elements of R[], if there are any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
}
No comments:
Post a Comment