UVA 12086 Potentiometers（线段树）

点击打开链接

N - datastruct-easy

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Appoint description:

Description

   

B	Potentiometers   Input: Standard Input   Output:  Standard Output

A potentiometer, or potmeter for short, is anelectronic device with a variable electric resistance. It has two terminals andsome kind of control mechanism (often a dial, a wheel or a slide) with whichthe resistance between the terminals can be adjusted from zero (no resistance)to some maximum value. Resistance is measured in Ohms, and when two or moreresistors are connected in series (one after the other, in a row), the totalresistance of the array is the sum of the resistances of the individualresistors.

In this problem we will consider an array of Npotmeters, numbered 1 to N from left to right. The left terminalof some potmeter numbered x is connected to the right terminal ofpotmeter x-1, and its right terminal to the left terminal of potmeter x+1.The left terminal of potmeter 1 and the right terminal of potmeter Nare not connected.

Initially all the potmeters are set to some valuebetween 0 and 1000 Ohms. Then we can do two things:

• Set one of the potmeters to another     value.
• Measure the resistance between     two terminals anywhere in the array.

Input

The input consists less than 3cases. Each case starts with N, the number of potmeters in the array, ona line by itself. N can be as large as 200000. Each of next N linescontains one numbers between 0 and 1000, the initial resistances of thepotmeters in the order 1 to N. Then follow a number of actions,each on a line by itself. The number of actions can be as many as 200000. Thereare three types of action:

• "S x r" - set     potmeter x to r Ohms. x is a valid potmeter number     and r is between 0 and 1000.
• "M x y" - measure the     resistance between the left terminal of potmeter x and the right     terminal of potmeter y. Both numbers will be valid and x is     smaller than or equal to y.
• "END" - end of this     case. Appears only once at the end of a list of actions.

A case with N=0 signalsthe end of the input and it should not be processed.

 

Output

For each case in the input producea line "Case n:", where n is the case number, starting from 1.
For each measurement in the input, output a line containing one number: themeasured resistance in Ohms. The actions should be applied to the array ofpotmeters in the order given in the input.
Print a blank line between cases.

 

Warning: Input Data is prettybig (~  8 MB) so use faster IO.

 

 

Sample Input                            Output for Sample Input

   

3   100   100   100   M  1 1   M  1 3   S  2 200   M  1 2   S  3 0   M  2 3   END   10   1   2   3   4   5   6   7   8   9   10   M  1 10   END   0

Case  1:   100   300   300   200       Case  2:   55

题意：给定N个电阻值，然后有两种操作，M a b操作是查询a b之间的电阻值之和，S a b 操作时改变a电阻值为b,对于每一个M操作，输出一个电阻值之和。

#include<stdio.h>
#include<string.h>
int z[4*200007];
char s[10];

struct sa
{
    int left,right,num;
}tree[4*200007];

void build(int left,int right,int i)//建树
{
    tree[i].left=left;
    tree[i].right=right;
    if(left==right)
    {
        tree[i].num=z[left];
        return;
    }
    int mid=(left+right)/2;
    build(left,mid,2*i);
    build(mid+1,right,2*i+1);
    tree[i].num=tree[2*i].num+tree[2*i+1].num;
}

void update(int id,int num,int i)//更新树
{
    if(tree[i].left==tree[i].right)
    {
        tree[i].num=num;//更新值
        return;
    }
    else
    {

        if(id<=tree[i*2].right)update(id,num,i*2);
        else update(id,num,i*2+1);
        tree[i].num=tree[i*2].num+tree[i*2+1].num;
    }
}

int query(int left,int right,int i)//查询树
{
    if(tree[i].left==left&&tree[i].right==right)return tree[i].num;
    int mid=(tree[i].left+tree[i].right)/2;
    if(right<=mid)return query(left,right,i*2);
    else if(left>mid)return query(left,right,i*2+1);
    else return query(left,mid,i*2)+query(mid+1,right,i*2+1);
}

int main()
{
    int m,i,j,k=1;
    while(scanf("%d",&m),m)
    {
        for(i=1;i<=m;i++)
        {
            scanf("%d",&z[i]);
        }
        build(1,m,1);
        if(k!=1)printf("\n");
        printf("Case %d:\n",k++);

        int a,b;
        while(1)
        {
            scanf("%s",s);
            if(strcmp(s,"END")==0)
            break;
             scanf("%d%d",&a,&b);
             if(strcmp(s,"M")==0)
             {
                 int ans=query(a,b,1);
                 printf("%d\n",ans);
             }
             if(strcmp(s,"S")==0)
             {
                 update(a,b,1);
             }
        }

    }
    return 0;
}