Submission #152875

#	Time	Username	Problem	Language	Result	Execution time	Memory
152875		Segtree	Meetings (IOI18_meetings)	C++14	0 / 100	18 ms	2040 KiB

meetings

#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
typedef long long ll;
#define mod 1000000007
vector<ll> minimum_costs(vector<int> H,vector<int> L,vector<int> R){
    vector<ll> anss;
    for(int i=0;i<L.size();i++){
	ll res[5010];
	stack<pair<ll,ll> >s,t;
	ll sum=0;
	for(int k=L[i];k<=R[i];k++){
	    ll cnt=0;
	    while(!s.empty()&&s.top().first<=H[k]){
		cnt+=s.top().second;
		sum-=s.top().first*s.top().second;
		s.pop();
	    }
	    if(cnt>0||k==L[i]){
		s.push(make_pair(H[k],cnt+1));
		sum+=H[k]*(cnt+1);
	    }
	    res[k]=sum;
	}
	while(!s.empty()){
	    s.pop();
	}
	sum=0;
	for(int k=R[i];k>=L[i];k--){
	    ll cnt=0;
	    while(!s.empty()&&s.top().first<=H[k]){
		cnt+=s.top().second;
		sum-=s.top().first*s.top().second;
		s.pop();
	    }
	    if(cnt>0||k==R[i]){
		s.push(make_pair(H[k],cnt+1));
		sum+=H[k]*(cnt+1);
	    }
	    res[k]+=sum;
	}
	ll ans=0;
	for(int k=L[i];k<=R[i];k++){
	    ans=max(ans,res[k]-H[k]);
	}
	anss.push_back(ans);
    }
    return anss;
}/*
int main(){
  
  return 0;
}*/

Compilation message (stderr)

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:10:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<L.size();i++){
                 ~^~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40