标签:
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18763 Accepted Submission(s): 9415
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
using namespace std;
int tt,n,m,a[100005][3];
int main()
{
scanf("%d",&tt);
for(int k=1;k<=tt;k++)
{
int sum=0;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
for(int i=1;i<=n;i++)
{
int v=1;
for(int j=m;j>=1;j--)
{
if(a[j][0]<=i&&a[j][1]>=i)
{
v=a[j][2];
break;
}
}
sum+=v;
}
printf("Case %d: The total value of the hook is %d.\n",k,sum);
}
return 0;
}
标签:
原文地址:http://www.cnblogs.com/a972290869/p/4254642.html