Submission #864206

#	Time	Username	Problem	Language	Result	Execution time	Memory
864206		8pete8	Financial Report (JOI21_financial)	C++14	0 / 100	123 ms	19172 KiB

Main

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,pii>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mod=9901,mxn=3*1e5+5,inf=1e18,lg=25,minf=-1e18;
int n;
struct seg{
    int v[2*mxn+10];
    void update(int pos,int val){
        pos+=n;
        v[pos]+=val;
        for(;pos>0;pos>>=1)v[pos>>1]=max(v[pos],v[pos^1]);
    }
    int qry(int l,int r){
        int ans=0;
        for(l+=n,r+=n;l<=r;l>>=1,r>>=1){
            if(l&1)ans=max(ans,v[l++]);
            if(!(r&1))ans=max(ans,v[r--]);
        }
        return ans;
    }
}t;
int32_t main(){
    int d;cin>>n>>d;
    vector<pii>v(n);
    for(int i=0;i<n;i++)cin>>v[i].f,v[i].s=i;
    sort(all(v));
    for(int i=0;i<v.size();i++){
        int cur=i;
        vector<pii>up;
        while(cur<n&&v[i].f==v[cur].f){
            up.pb({v[cur].s,t.qry(max(0ll,v[i].s-d),v[i].s)+1});
            cur++;
        }
        i=cur-1;
        for(auto i:up)t.update(i.f,i.s);
    }
    cout<<t.qry(0,n);
}

Compilation message (stderr)

Main.cpp: In function 'int32_t main()':
Main.cpp:55:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35