zoukankan      html  css  js  c++  java
  • 不用建树的方法

    Just a Hook

    Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 14578    Accepted Submission(s): 7203


    Problem Description
    In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.



    Now Pudge wants to do some operations on the hook.

    Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
    The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:

    For each cupreous stick, the value is 1.
    For each silver stick, the value is 2.
    For each golden stick, the value is 3.

    Pudge wants to know the total value of the hook after performing the operations.
    You may consider the original hook is made up of cupreous sticks.
     
    Input
    The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases.
    For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
    Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents the golden kind.
     
    Output
    For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example.
     
    Sample Input
    1 10 2 1 5 2 5 9 3
     
    Sample Output
    Case 1: The total value of the hook is 24.
     

     让天才成为天才的,不是别的,是创新!

    这代码给的比线段树漂亮多了!真是简单到了极致!

    还是有一点,hdu的数据没给好,这个方法好是好,但是真给个合适的数据,这种复杂度恐怕吃不消吧。

    #define _CRT_SECURE_NO_DEPRECATE
    #include<iostream>
    #include<cstdio>
    #include<string>
    #include<cstring>
    #include<algorithm>
    #define MAX 1000005
    using namespace std;
    struct NODE{
        int i, j, v;
    };
    NODE nos[MAX];
    int n;
    
    int main()
    {
        int t, T, m, res, v;
        scanf("%d", &T);
        t = 1;
        while (t <= T){
            scanf("%d", &n);
            scanf("%d", &m);
            for (int i = 0; i < m; i++)scanf("%d %d %d", &nos[i].i, &nos[i].j, &nos[i].v);
            res = 0;
            for (int i = 1; i <= n;i++){
                v = 1;
                for (int j = m - 1; j>-1; j--){
                    if (i >= nos[j].i&&i <= nos[j].j){
                        v = nos[j].v;
                        break;
                    }
                }
                res += v;
            }
            printf("Case %d: The total value of the hook is %d.
    ", t, res);
            t++;
        }
        return 0;
    }
    世上无难事,只要肯登攀。
  • 相关阅读:
    硬盘参数你都懂吗?(上)-从案例引发的讨论
    Python 面试题(下)
    Python 面试题(上)
    DNS 原理入门
    从硬盘设计思想到RAID改良之道
    (转)短信vs.推送通知vs.电子邮件:app什么时候该用哪种方式来通知用户?
    (转)移动端主动推送消息原理
    (转)OpenFire源码学习之十七:HTTP Service插件
    (转)openfire插件开发(二) 基于web的插件开发
    (转)openfire插件开发(一)
  • 原文地址:https://www.cnblogs.com/littlehoom/p/3577406.html
Copyright © 2011-2022 走看看