Add new file

JZOJ5350. 【NOIP2017提高A组模拟9.7】陶陶摘苹果

+#include<queue>
+#include<cstdio>
+#include<iostream>
+#include<algorithm>
+#include <cstring>
+#include <string.h>
+#include <cmath>
+#include <math.h>
+#define ll long long
+#define N 203
+#define db double
+#define P putchar
+#define G getchar
+#define mo 1000000007
+using namespace std;
+char ch;
+void read(int &n)
+{
+    n=0;
+    ch=G();
+    while((ch<'0' || ch>'9') && ch!='-')ch=G();
+    ll w=1;
+    if(ch=='-')w=-1,ch=G();
+    while('0'<=ch && ch<='9')n=n*10+ch-'0',ch=G();
+    n*=w;
+}
+
+int max(int a,int b)
+{
+    return a>b?a:b;
+}
+
+void write(int x)
+{
+     if(x>9) write(x/10);
+     P(x%10+'0');
+}
+
+struct node
+{
+    int l,r;
+}a[N];
+
+bool cmp(node a,node b)
+{
+    return (a.l<b.l) || (a.l==b.l && a.r>b.r);
+}
+
+int f[N][N],n,m,h,k,x,sum,ans,mx,s[N*5000],v[N];
+
+int main()
+{
+    freopen("apple.in","r",stdin);
+    freopen("apple.out","w",stdout);
+    read(n);read(m);read(h);read(k);mx=sum=ans=0;
+    for(int i=1;i<=n;i++)
+    {
+        read(x);
+        mx=max(mx,x);
+        if(x>h)s[x-h]++;
+        if(x==h)sum++;
+    }
+
+    for(int i=1;i<=m;i++)
+    {
+        read(a[i].l),read(a[i].r);
+        if(a[i].l==0)a[i].l=1;
+        mx=max(mx,a[i].r);
+    }
+
+    for(int i=1;i<=mx;i++)
+        s[i]+=s[i-1];
+
+    x=0;
+    for(int i=1;i<=m;i++)   
+        for(int j=1;j<=m;j++)
+            if(i!=j && a[i].l!=2147483647 && a[i].l<=a[j].l && a[j].r<=a[i].r)x++,a[j].l=a[j].r=2147483647;
+
+    sort(a+1,a+1+m,cmp);
+    m-=x;
+    for(int i=1;i<=m;i++)
+        v[i]=s[a[i].r]-s[a[i].l-1];
+
+    for(int i=1;i<=m;i++)
+        for(int j=1;j<=min(i,k);j++)
+        {
+            for(int t=0;t<=i-1;t++)
+            {
+                if(a[t].r>=a[i].l)f[i][j]=max(f[i][j],f[t][j-1]+v[i]-s[a[t].r]+s[a[i].l-1]);
+                    else f[i][j]=max(f[i][j],f[t][j-1]+v[i]);
+            }
+            ans=max(ans,f[i][j]);
+        }
+
+    write(ans);
+}
\ No newline at end of file