[河南省ACM省赛-第三届] 房间安排 （nyoj 168）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define N 200

int day
;//day[i] 第i天的最多房间数

int main()
{
freopen("d:\\in.txt", "r", stdin);
int t, n;
scanf("%d", &t);
while(t--){
memset(day, 0, sizeof(day));
scanf("%d", &n);
int num, start, length;
for(int i=0; i<n; i++){
scanf("%d%d%d", &num, &start, &length);
for(int i=0; i<length; i++){
day[i+start] += num;
}
}
int ans = 0;
for(int i=0; i<N; i++){
ans = max(ans, day[i]);
}
printf("%d\n", ans);
}

return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
#define INPUT freopen("d:\\in.txt", "r", stdin);
#define N 10002

struct Node {
int a, b, v;
}c
;

bool cmp(Node n1, Node n2)
{
return n1.a != n2.a ? n1.a < n2.a : n1.b < n2.b;
}
int main()
{
INPUT;

int t, n;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
int day;
for(int i=0; i<n; i++){
scanf("%d%d%d", &c[i].v, &c[i].a, &day);
c[i].b = c[i].a+day;
}
sort(c, c+n, cmp);
int ans = c[0].v;
for(int i=1; i<n; i++){
int cur = c[i].v;
ans += cur;
for(int j=0; j<i; j++){
if(c[j].v && cur && c[j].b <= c[i].a){//如果 j团有剩余房间 且 当前订单还需要房间 且j团已离开
int reuse = min(c[j].v, cur);
ans -= reuse;
c[j].v -= reuse;
cur -= reuse;
}
}
}
printf("%d\n", ans);
}
return 0;
}