zoukankan      html  css  js  c++  java
  • Codeforces Round #321 (Div. 2) B. Kefa and Company (尺取)

    排序以后枚举尾部。尺取,头部单调,维护一下就好。

    排序O(nlogn),枚举O(n)

    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    //#define LOCAL
    const int maxn = 1e5+5;
    struct Node
    {
        int m,s;
        void IN(){ scanf("%d%d",&m,&s); }
        bool operator < (const Node&rh) const {
            return m < rh.m;
        }
    }nd[maxn];
    
    ll ss[maxn];
    
    int main()
    {
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif
        int n,d; scanf("%d%d",&n,&d);
        for(int i = 1; i <= n; i++){
            nd[i].IN();
        }
        sort(nd+1,nd+1+n);
        for(int i = 1; i <= n; i++){
            ss[i] = ss[i-1]+nd[i].s;
        }
        ll ans = 0;
        for(int i = 1,j = 1; i <= n; i++){
            while(j<n && nd[j+1].m - nd[i].m < d) j++;
            ans = max(ans,ss[j]-ss[i-1]);
        }
        printf("%I64d",ans);
        return 0;
    }
  • 相关阅读:
    css中!important的用法
    mysql分区
    js 随机生成信用卡号
    js argument
    lnmp
    php的mcrypt
    php gd
    php socket
    最优服务次序问题 水 NOJ1254
    众数问题 NOJ 1207
  • 原文地址:https://www.cnblogs.com/jerryRey/p/4831291.html
Copyright © 2011-2022 走看看