Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Bitnami MediaWiki
Search
Search
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
3872 - cnt seq max min
(section)
Page
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
= Exemplul 1: = Intrare 5 2 1 7 2 3 4 Ieșire 8 == Explicație == Cele <code>8</code> subsecvențe care respectă condiția din enunț sunt toate cele <code>5</code> care conțin un singur element(diferența dintre elementul maxim și cel minim fiind astfel <code>0</code>), respectiv cele delimitate de perechile de indecși <code>[3, 4], [3, 5], [4, 5]</code>(șirul se consideră a fi indexat de la <code>1</code>). == Exemplul 2: == Intrare 123213123 323 Ieșire Datele nu corespund restrictiilor impuse == Rezolvare == <syntaxhighlight lang="python3" line="1"> def numar_subsecvente(arr, T): n = len(arr) rezultat = 0 # Sortăm șirul pentru a face procesul mai eficient arr.sort() # Folosim doi pointeri pentru a găsi subsecvențele stanga = 0 dreapta = 0 while stanga < n: while dreapta < n and arr[dreapta] - arr[stanga] <= T: dreapta += 1 # Numărul de subsecvențe care încep cu stanga și au dreapta ca ultim element rezultat += dreapta - stanga # Ne deplasăm spre următorul element stanga += 1 return rezultat print("Numărul de subsecvențe este:", rezultat) from collections import deque def check_restrictions(n, t, v): if not (1 <= n <= 1000000): return False if not (0 <= t <= 2000000000): return False for num in v: if not (-1000000000 <= num <= 1000000000): return False return True def solve(n, t, v): st = dr = 0 mini = deque() maxi = deque() ans = 0 for i in range(n): while mini and v[i] < v[mini[-1]]: mini.pop() while maxi and v[i] > v[maxi[-1]]: maxi.pop() mini.append(i) maxi.append(i) if maxi and mini and v[maxi[0]] - v[mini[0]] <= t: ans += dr - st + 1 else: while maxi and mini and v[maxi[0]] - v[mini[0]] > t: if maxi[0] == st: maxi.popleft() if mini[0] == st: mini.popleft() st += 1 if maxi and mini: ans += dr - st + 1 dr += 1 print(ans) def main(): n, t = map(int, input().split()) if not (1 <= n <= 1000000) or not (0 <= t <= 2000000000): print("Datele nu corespund restrictiilor impuse") return v = [int(x) for x in input().split()] if not check_restrictions(n, t, v): print("Datele nu corespund restrictiilor impuse") return solve(n, t, v) main() </syntaxhighlight>
Summary:
Please note that all contributions to Bitnami MediaWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Bitnami MediaWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Toggle limited content width