bzoj1676: [Usaco2005 Feb]Feed Accounting 饲料计算

链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1676

题意：中文题。。

分析：应该是最裸的差分之一了。。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=2010;
const int MAX=151;
const int MOD=1000007;
const int MOD1=100000007;
const int MOD2=100000009;
const int INF=2100000000;
const double EPS=0.00000001;
typedef long long ll;
typedef unsigned long long ull;
int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int f[N];
int main()
{
    int a,b,c,d,i,f1,f2;
    scanf("%d%d%d%d", &c, &f1, &f2, &d);
    memset(f,0,sizeof(f));
    for (i=1;i<=c;i++) {
        scanf("%d%d", &a, &b);
        f[a]++;f[b+1]--;
    }
    for (i=1;i<=2000;i++) f[i]+=f[i-1];
    f1=f1-f2;
    for (i=d;i>0;i--) {
        f1-=f[i];
        if (!f1) break ;
    }
    printf("%d\n", i);
    return 0;
}

/*
3 14 4 10
1 9
5 8
8 12
*/