161392025-04-06 11:37:41linhnkTűzijátékcpp17Accepted 50/5046ms820 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, a, miss, cur;
    cin>>n>>a>>miss;
    vector<int> tav(n);
    vector<int> ki;
    ki.push_back(a-1);
    for(int i=0; i<n; i++){
        cin>>tav[i];
    }
    cur=tav[a-1];
    for(int i=a-1; i>=0; i--){
        if(cur-tav[i]>=miss){
            ki.push_back(i);
            cur=tav[i];
        }
    }
    cur=tav[a-1];
     for(int i=a-1; i<n; i++){
        if(tav[i]-cur>=miss){
            ki.push_back(i);
            cur=tav[i];
        }
    }
    cout<<ki.size()<<endl;
    sort(ki.begin(), ki.end());
    for(auto z:ki){
        cout<<z+1<<" ";
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/043ms800 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms364 KiB
9Accepted2/23ms500 KiB
10Accepted2/24ms448 KiB
11Accepted2/24ms316 KiB
12Accepted2/28ms316 KiB
13Accepted2/28ms544 KiB
14Accepted2/28ms316 KiB
15Accepted3/38ms316 KiB
16Accepted3/312ms520 KiB
17Accepted3/317ms576 KiB
18Accepted3/320ms604 KiB
19Accepted3/346ms804 KiB
20Accepted3/343ms820 KiB
21Accepted4/443ms804 KiB
22Accepted4/443ms568 KiB