Segment Tree/ Fenwick Tree with range update and point query

#include <iostream>
using namespace std;

int main() {
unsigned long long n,a,b,c,s;
int i;
unsigned long long  x[100001];
memset(x,0,sizeof(x));
cin>>n;
for (i=1;i<=n+1;i++)
{
cin>>a>>b>>c;
x[a]=x[a]+c;
x[b+1]=x[b+1]-c;
};s=0;
for (i=1;i<=n;i++)
{
s=s+x[i];
if (i==n) cout<<s<<endl; else
cout<<s<<" ";
}
};

.
случайно
Edited by author 08.12.2020 04:24

Edited by author 08.12.2020 04:24

Edited by author 08.12.2020 04:24

This problem is very easy.
I use idea similar dp.

Edited by author 30.05.2018 19:11

I use very simple algo, prompt other algo please.

Edited by author 10.08.2011 15:32

[code deleted]

Edited by author 20.10.2006 23:12

Edited by moderator 01.12.2019 21:13

Who can explain me: if N == 1, what numbers (a, b, c) the knight can say?

Help please!
I don't understand how I can make my program faster.
This algorithm is slow ( n*(b-a) times).

{Time Limit on test 17}
var a,b,c,j:word; q:array[1..100000] of longint; i,n:longint;
begin
readln(n);
for i:=1 to n+1 do begin
readln(a,b,c);
for j:=a to b do q[j]:=q[j]+c;
end;
write(q[1]); for i:=2 to n do write(' ',q[i]);
end.

Edited by author 14.09.2007 18:07

TLE №18
Can you please give me any hint?