Created
January 21, 2014 05:33
-
-
Save KT-Yeh/8534896 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <algorithm> | |
using namespace std; | |
int M, K; | |
int p[501]; | |
int ans[501][501],n[501]; // n is the index of ans[i]; | |
int main() | |
{ | |
int N; | |
scanf("%d",&N); | |
while (N--){ | |
scanf ("%d%d",&M,&K); | |
long long int Min=0,Max=0,mid; | |
for (int i=0;i<M;i++) { | |
scanf("%d",&p[i]); | |
if (p[i] > Min) Min=p[i]; | |
Max += p[i]; | |
} | |
while (Min < Max){ | |
int amount=1; | |
long long int sum=0; | |
mid = (Min+Max)/2; | |
for (int i=0;i<M;i++){ | |
if (sum+p[i] > mid){ | |
amount++; | |
sum = 0; | |
} | |
sum += p[i]; | |
} | |
if (amount > K) Min = mid+1; | |
else Max = mid; | |
} | |
fill (n,n+501,0); | |
long long sum = 0; | |
// 因為如果有多組解,後面的人要分配多一點書,因此i,j從後面開始 | |
for (int i=M-1, j=K-1; i>=0; i--){ // i: book index, j: scriber index | |
if (sum+p[i] > Max || j>i){ // j>i: 因為每個人都至少要有一本書 | |
j--; | |
sum = 0; | |
} | |
sum += p[i]; | |
ans[j][n[j]++] = p[i]; | |
} | |
for (int i=0; i<K; i++){ | |
for (int j=n[i]-1; j>=0; j--){ | |
if (i!=0 || j!=n[0]-1) printf(" "); | |
printf("%d",ans[i][j]); | |
} | |
if (i != K-1) printf(" /"); | |
} | |
printf("\n"); | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment