题目地址:点击打开链接
思路:暴力模拟一下就行
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
using namespace std;
int visit[10010];
int main()
{
int t,n,days,start,last;
int i,j;
scanf("%d",&t);
while(t--)
{
memset(visit,0,sizeof(visit));
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d%d%d",&days,&start,&last);
for(j=start; j<=start+last-1; j++)
{
visit[j] += days;
}
}
int max1 = 0;
for(i=1; i<=10000; i++)
{
if(visit[i] > max1)
max1 = visit[i];
}
printf("%d\n",max1);
}
return 0;
}