View Code of Problem 3810

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <fstream>
#include <algorithm>
#include <ctime>
using namespace std;

typedef long long ll;
#define MAX(a,b) (a)>(b)?(a):(b)
#define MAXN 200010
#define INF 0x3f3f3f3f
const int mod=1000000009;

int x[110];

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(!n) break;
        memset(x,0,sizeof(x));
        int s,d,h;
        for(int i=0;i<n;i++)
        {
            scanf("%d%d%d",&s,&d,&h);
            for(int i=s;i<d;i++)
                x[i]+=h;
        }
        int ans=0;
        for(int i=1;i<=100;i++)
            ans=MAX(ans,x[i]);
        printf("%d\n",ans);
    }
    return 0;
}