제출 #158251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
158251		brcode	Pairs (IOI07_pairs)	C++14	0 / 100	78 ms	2040 KiB

pairs

#include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 2e5+5;
int ans;
stack<int> s1;
int arr[MAXN];
int main(){
    int b,n,d,m;
    cin>>b>>n>>d>>m;
    if(b==1){
        for(int i=1;i<=n;i++){
            cin>>arr[i];
        }
        sort(arr+1,arr+n+1);
        for(int i=1;i<=n;i++){

            while(s1.size() && s1.top()<arr[i]-d){
                s1.pop();
            }
            ans+=(s1.size());
            s1.push(arr[i]);
        }
        cout<<ans<<endl;

    }

}

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