# Codeforces Round #291 (Div. 2) D. R2D2 and Droid Army RMQ问题 ST算法

D. R2D2 and Droid Army
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

An army of n droids is lined up in one row. Each droid is described by m integers a1, a2, ..., am, where ai is the number of details of thei-th type in this droid's mechanism. R2-D2 wants to destroy the sequence of consecutive droids of maximum length. He has m weapons, the i-th weapon can affect all the droids in the army by destroying one detail of the i-th type (if the droid doesn't have details of this type, nothing happens to it).

A droid is considered to be destroyed when all of its details are destroyed. R2-D2 can make at most k shots. How many shots from the weapon of what type should R2-D2 make to destroy the sequence of consecutive droids of maximum length?

Input

The first line contains three integers n, m, k (1 ≤ n ≤ 1051 ≤ m ≤ 50 ≤ k ≤ 109) — the number of droids, the number of detail types and the number of available shots, respectively.

Next n lines follow describing the droids. Each line contains m integers a1, a2, ..., am (0 ≤ ai ≤ 108), where ai is the number of details of the i-th type for the respective robot.

Output

Print m space-separated integers, where the i-th number is the number of shots from the weapon of the i-th type that the robot should make to destroy the subsequence of consecutive droids of the maximum length.

If there are multiple optimal solutions, print any of them.

It is not necessary to make exactly k shots, the number of shots can be less.

Sample test(s)
input
5 2 4
4 0
1 2
2 1
0 2
1 3

output
2 2

input
3 2 4
1 2
1 3
2 2

output
1 3

Note

In the first test the second, third and fourth droids will be destroyed.

In the second test the first and second droids will be destroyed.

q问题 ，用线段树 st算法等等，都可以总复杂度，n*log(n);

#define N 100005
#define MOD 1000000000000000007
int n,m,k;
int maxsum[N][21][6];
void RMQ(int num)
{
for(int mm = 0;mm < m;mm++){
for(int j = 1; j < 20; ++j)
for(int i = 1; i <= num; ++i)
if(i + (1 << j) - 1 <= num)
{
maxsum[i][j][mm] = max(maxsum[i][j - 1][mm] , maxsum[i + (1 << (j - 1))][j - 1][mm] );
}
}
}
int getRMQ(int i,int j,int m){
int k=log2( j - i + 1);
return max(maxsum[i][k][m], maxsum[j-(1<<k)+1][k][m]);
}
int check(int len){
for(int i=1;i+len-1<=n;i++){
int ans = 0;
FJ(m){
ans +=getRMQ(i,i+len-1,j);
}
if(ans <= k)
return i;
}
return -1;
}
void outPut(int start,int len){
FJ(m){
if(j)
printf(" %d",len==0?0:getRMQ(start,start+len-1,j));
else
printf("%d",len==0?0:getRMQ(start,start+len-1,j));
}
printf("\n");
}
int main()
{
S2(n,m);
{
S(k);
FI(n){
FJ(m){
S(maxsum[i+1][0][j]);
}
}
RMQ(n);
int s = 1,e = n,mid;
while(s<e-1){
mid = (s+e)/2;
if(check(mid) != -1)
s = mid;
else
e = mid;
}
int t = 0;
if((t = check(e))!= -1){
outPut(t,e);
}
else if((t = check(s))!= -1){
outPut(t,s);
}
else {
outPut(t,0);
}
}
return 0;
}

• 本文已收录于以下专栏：

## RMQ -- ST算法 Codeforces Round #291 (Div. 2) D. R2D2 and Droid Army

http://kmplayer.iteye.com/blog/575725

## 【打CF，学算法——四星级】CodeForces 514D R2D2 and Droid Army （RMQ+二分）

【CF简介】 提交链接：CF 514D 题面： D. R2D2 and Droid Army time limit per test 2 seconds ...

## 【codeforces 514D】R2D2 and Droid Army

【题目链接】:http://codeforces.com/contest/514/problem/D【题意】 给你每个机器人的m种属性p1..pm 然后r2d2每次可以选择m种属性中的一种,进...

## CodeForces - 514D ：R2D2 and Droid Army（二分、暴力）

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)