Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> using namespace std; int main() { int n; cin >> n; int niza[n]; for(int i = 0; i < n; i++) { cin >> niza[i]; } int Q; cin >> Q; int zadaci[Q][2]; for(int i = 0; i < Q; i++) { cin >> zadaci[i][0] >> zadaci[i][1]; } // kako se pravi prefix sum? // prvo pravime nova niza, so ista golemina ko nizata na koja sakame // da presmetuvame zbir int prefix_sum[n]; int zbir = 0; // treba da ja pomineme sega nizata for(int i = 0; i < n; i++) { zbir += niza[i]; prefix_sum[i] = zbir; } for(int i = 0; i < Q; i++) { int S = zadaci[i][0]; // poceten indeks int E = zadaci[i][1]; // kraen indeks if(S == 0) { cout << prefix_sum[E] << endl; } else { cout << (prefix_sum[E] - prefix_sum[S - 1]) << endl; } } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
