209982026-01-11 23:51:45LacikaKvTűzijátékcpp17Accepted 50/5016ms1156 KiB
#include <iostream>
#include <list>

using namespace std;

int main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);

   list<int> eredm;

   int i,telepules_szam, telephely_index, minimalis_tav,pos;

   cin >> telepules_szam >> telephely_index >> minimalis_tav;

   int tavok[telepules_szam];

   for (i=0;i<telepules_szam;i++) {
      cin >> tavok[i];
   }

   telephely_index --; // 0 tol indexelunk!

   pos = tavok[telephely_index];
   i = telephely_index-1;
   eredm.push_front(telephely_index);
   while(i>=0) {
      if ((pos-tavok[i]) >= minimalis_tav) {
         eredm.push_front(i);
         pos = tavok[i];
      }
      i--;
   }
   pos = tavok[telephely_index];
   i = telephely_index+1;
   while(i<telepules_szam) {
      if ((tavok[i]-pos) >= minimalis_tav) {
         eredm.push_back(i);
         pos = tavok[i];
      }
      i++;
   }
   cout << eredm.size() << endl;
   for ( int n : eredm)
      cout << n + 1 << " ";

//   cout << eredm.size() << endl;
//   while (!eredm.empty()) {
//      cout << eredm.front() << " ";
//      eredm.pop_front();
//   }
   return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/016ms1072 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms508 KiB
9Accepted2/22ms508 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms316 KiB
12Accepted2/23ms472 KiB
13Accepted2/24ms580 KiB
14Accepted2/23ms316 KiB
15Accepted3/34ms316 KiB
16Accepted3/34ms432 KiB
17Accepted3/37ms712 KiB
18Accepted3/38ms716 KiB
19Accepted3/316ms912 KiB
20Accepted3/316ms1028 KiB
21Accepted4/416ms1156 KiB
22Accepted4/414ms792 KiB