제출 #490584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
490584		niloyroot	Untitled (POI11_tem)	C++14	8 / 100	214 ms	35624 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;

void solve(){
    ll n; cin>>n;
    ll l[n+1],r[n+1];
    forp(i,1,n){
        cin>>l[i]>>r[i];
    }
    
    ll ans=0;
    ll curr=l[1];
    ll temp=1;
    forp(i,2,n){
        if(r[i]<curr){
            ans=max(ans,temp);
            curr=l[i];
            temp=1;
        } else if(l[i]>curr){
            curr=l[i];
            temp++;
        } else {
            temp++;
        }
    }
    cout<<max(ans,temp)<<newl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9