zoukankan      html  css  js  c++  java
  • 5.3.1 See you~ (二维树状数组)(UNSOLVED)

    See you~

    Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
    Total Submission(s): 144 Accepted Submission(s): 47

    Problem Description
    Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good friends. I want to say sorry to Mr, Yin, I must leave now ~~>.<~~. I am very sorry, we could not advanced to the World Finals last year.
    When coming into our training room, a lot of books are in my eyes. And every time the books are moving from one place to another one. Now give you the position of the books at the early of the day. And the moving information of the books the day, your work is to tell me how many books are stayed in some rectangles.
    To make the problem easier, we divide the room into different grids and a book can only stayed in one grid. The length and the width of the room are less than 1000. I can move one book from one position to another position, take away one book from a position or bring in one book and put it on one position.
     

    Input
    In the first line of the input file there is an Integer T(1<=T<=10), which means the number of test cases in the input file. Then N test cases are followed.
    For each test case, in the first line there is an Integer Q(1<Q<=100,000), means the queries of the case. Then followed by Q queries.
    There are 4 kind of queries, sum, add, delete and move.
    For example:
    S x1 y1 x2 y2 means you should tell me the total books of the rectangle used (x1,y1)-(x2,y2) as the diagonal, including the two points.
    A x1 y1 n1 means I put n1 books on the position (x1,y1)
    D x1 y1 n1 means I move away n1 books on the position (x1,y1), if less than n1 books at that position, move away all of them.
    M x1 y1 x2 y2 n1 means you move n1 books from (x1,y1) to (x2,y2), if less than n1 books at that position, move away all of them.
    Make sure that at first, there is one book on every grid and 0<=x1,y1,x2,y2<=1000,1<=n1<=100.
     

    Output
    At the beginning of each case, output "Case X:" where X is the index of the test case, then followed by the "S" queries.
    For each "S" query, just print out the total number of books in that area.
     

    Sample Input
    2
    3
    S 1 1 1 1
    A 1 1 2
    S 1 1 1 1
    3
    S 1 1 1 1
    A 1 1 2
    S 1 1 1 2
     

    Sample Output
    Case 1:
    1
    3
    Case 2:
    1
    4

    思路:我不会做,二维的树状数组,直接给链接

    http://www.cnblogs.com/183zyz/archive/2012/04/11/2442070.html

  • 相关阅读:
    mysql练习
    导航 开发 常用 官方网址 办公 政府 网站 url
    Yii 数据库 连接 Error Info: 向一个无法连接的网络尝试了一个套接字操作。
    xampp Apache Access forbidden! Error 403 解决方法
    MySQL 没有密码 初始化 设置 用户名
    Apache 虚拟机 vhosts C:WINDOWSsystem32driversetchosts
    js 返回上一页 链接 按钮
    MySQL concat concat_ws group_concat 函数(连接字符串)
    PHP的UTF-8中文转拼音处理类(性能已优化至极致)
    原生JavaScript实现金额大写转换函数
  • 原文地址:https://www.cnblogs.com/cssystem/p/2992559.html
Copyright © 2011-2022 走看看