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

原创 2015年07月06日 17:02:18
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.

题意,给一排机器人,每个机器人有m个值,m个炮弹,每个炮弹发射一次,每个相应的值就减1,直到减为0结束,要求总发射次数不超过k次的情况下

连续为0的机器人个数最多,二分枚举长度,对每个长度计算i i+len之间的最大值,相加不超过k,就可以使这len排的数全部减成0,所以问题转化成了rm

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

Codeforces Round #291 (Div. 2) D - R2D2 and Droid Army

就是就最长的一段各位的最大之和不超过k。。。。用双指针和STL随便写写。。。 #include #include #include #include #include #include ...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

D. R2D2 and Droid Army 线段树+二分 Codeforces Round #291 (Div. 2)

题意:n个机器人,每个机器人有m个值,你有k次射击机会,每一次射击可以使所有机器人的某一个值减少1,一个机器人的m个值全为0时视为该机器人被摧毁了,问在能破坏的最大的机器人数目下(机器人要连续),m个...

Codeforces 514D R2D2 and Droid Army RMQ问题

题目大意: 就是现在对于一个m行n列的矩阵, 每次可以选择m行中的任意一行的正整数-1,最多选择k次, 如果某一列中的m个数全部成为了0, 那么这一列算作被破坏, 求被破坏的连续的列 最长是多少列,...

【打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 (RMQ+二分)

题意: 有n*m的矩阵,然后你有k发子弹。现在你可以朝着任意列发射子弹,每一发子弹都会使该列上的数值-1,最小减少到0。 现在问你连续最长的行数,在k发子弹内,使得这些行上的数值全部为0. ...

R2D2 and Droid Army : CodeForces - 514D RMQ+单调性

题目:CodeForces - 514Dtime limit per test2 seconds memory limit per test256 megabytes An army of n d...

CodeForces 514D-R2D2 and Droid Army

题目 D. R2D2 and Droid Army time limit per test 2 seconds memory limit per test 256...

【codeforces 514D】R2D2 and Droid Army

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

CodeForces - 514D :R2D2 and Droid Army(二分、暴力)

原题链接:CodeForces - 514D 题意:有n个机器排成一列,每个机器有m种类型的描述,每种类型的描述包括a个细节,现在你有m种类型的武器,可以射击k次,第i种武器一次可以摧毁该列所有机器...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)