Considere una array A[] de enteros y los siguientes dos tipos de consultas.
- update(l, r, x): multiplica x por todos los valores de A[l] a A[r] (ambos inclusive).
- printArray(): Imprime la array modificada actual.
Ejemplos:
Input: A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
update(0, 2, 2)
update(1, 4, 3)
print()
update(4, 8, 5)
print()
Output: 2 6 6 3 15 5 5 5 5 1
Explanation:
The query update(0, 2, 2)
multiply 2 to A[0], A[1] and A[2].
After update, A[] becomes {2, 2, 2, 1, 1, 1, 1, 1, 1, 1}
Query update(1, 4, 3) multiply 3 to A[1],
A[2], A[3] and A[4]. After update, A[] becomes
{2, 6, 6, 3, 3, 1, 1, 1, 1, 1}.
Query update(4, 8, 5) multiply 5, A[4] to A[8].
After update, A[] becomes {2, 6, 6, 3, 15, 5, 5, 5, 5, 1}.
Input: A[] = {10, 5, 20, 40}
update(0, 1, 10)
update(1, 3, 20)
update(2, 2, 2)
print()
Output: 100 1000 800 800
Enfoque:
Una solución simple es hacer lo siguiente:
- actualizar (l, r, x): Ejecute un ciclo de l a r y multiplique x a todos los elementos de A [l] a A [r].
- print(): simplemente imprime A [].
La complejidad temporal de las dos operaciones anteriores es O(n).
Enfoque eficiente:
una solución eficiente es usar dos arrays, una para la multiplicación y otra para la división. mul[] y div[] respectivamente.
- Multiplica x por mul[l] y Multiplica x por div[r+1]
- Tome la multiplicación del prefijo de la array mul mul[i] = (mul[i] * mul[i-1] ) / div[i]
- printArray(): Haz A[0] = mul[0] e imprímelo. Para el resto de los elementos hacer A[i] = (A[i]*mul[i])
A continuación se muestra la implementación del enfoque anterior:
C++
// C++ program for
// the above approach
#include <bits/stdc++.h>
using namespace std;
// Creates a mul[] array for A[] and returns
// it after filling initial values.
void initialize(int mul[], int div[], int size)
{
for (int i = 1; i < size; i++) {
mul[i] = (mul[i] * mul[i - 1]) / div[i];
}
}
// Does range update
void update(int l, int r, int x, int mul[], int div[])
{
mul[l] *= x;
div[r + 1] *= x;
}
// Prints updated Array
void printArray(int ar[], int mul[], int div[], int n)
{
for (int i = 0; i < n; i++) {
ar[i] = ar[i] * mul[i];
cout << ar[i] << " ";
}
}
// Driver code;
int main()
{
// Array to be updated
int ar[] = { 10, 5, 20, 40 };
int n = sizeof(ar) / sizeof(ar[0]);
// Create and fill mul and div Array
int mul[n + 1], div[n + 1];
for (int i = 0; i < n + 1; i++) {
mul[i] = div[i] = 1;
}
update(0, 1, 10, mul, div);
update(1, 3, 20, mul, div);
update(2, 2, 2, mul, div);
initialize(mul, div, n + 1);
printArray(ar, mul, div, n);
return 0;
}
Java
// Java implementation of the approach
class GFG
{
// Creates a mul[] array for A[] and returns
// it after filling initial values.
static void initialize(int mul[],
int div[], int size)
{
for (int i = 1; i < size; i++)
{
mul[i] = (mul[i] * mul[i - 1]) / div[i];
}
}
// Does range update
static void update(int l, int r, int x,
int mul[], int div[])
{
mul[l] *= x;
div[r + 1] *= x;
}
// Prints updated Array
static void printArray(int ar[], int mul[],
int div[], int n)
{
for (int i = 0; i < n; i++)
{
ar[i] = ar[i] * mul[i];
System.out.print(ar[i] + " ");
}
}
// Driver code;
public static void main(String[] args)
{
// Array to be updated
int ar[] = { 10, 5, 20, 40 };
int n = ar.length;
// Create and fill mul and div Array
int []mul = new int[n + 1];
int []div = new int[n + 1];
for (int i = 0; i < n + 1; i++)
{
mul[i] = div[i] = 1;
}
update(0, 1, 10, mul, div);
update(1, 3, 20, mul, div);
update(2, 2, 2, mul, div);
initialize(mul, div, n + 1);
printArray(ar, mul, div, n);
}
}
// This code is contributed by Rajput-Ji
Python3
# Python3 program for the above approach # Creates a mul[] array for A[] and returns # it after filling initial values. def initialize(mul, div, size): for i in range(1, size): mul[i] = (mul[i] * mul[i - 1]) / div[i]; # Does range update def update(l, r, x, mul, div): mul[l] *= x; div[r + 1] *= x; # Prints updated Array def printArray(ar, mul, div, n): for i in range(n): ar[i] = ar[i] * mul[i]; print(int(ar[i]), end = " "); # Driver code; if __name__ == '__main__': # Array to be updated ar = [ 10, 5, 20, 40 ]; n = len(ar); # Create and fill mul and div Array mul = [0] * (n + 1); div = [0] * (n + 1); for i in range(n + 1): mul[i] = div[i] = 1; update(0, 1, 10, mul, div); update(1, 3, 20, mul, div); update(2, 2, 2, mul, div); initialize(mul, div, n + 1); printArray(ar, mul, div, n); # This code is contributed by Rajput-Ji
C#
// C# implementation of the approach
using System;
class GFG
{
// Creates a mul[] array for A[] and returns
// it after filling initial values.
static void initialize(int []mul,
int []div, int size)
{
for (int i = 1; i < size; i++)
{
mul[i] = (mul[i] * mul[i - 1]) / div[i];
}
}
// Does range update
static void update(int l, int r, int x,
int []mul, int []div)
{
mul[l] *= x;
div[r + 1] *= x;
}
// Prints updated Array
static void printArray(int []ar, int []mul,
int []div, int n)
{
for (int i = 0; i < n; i++)
{
ar[i] = ar[i] * mul[i];
Console.Write(ar[i] + " ");
}
}
// Driver code;
public static void Main(String[] args)
{
// Array to be updated
int []ar = { 10, 5, 20, 40 };
int n = ar.Length;
// Create and fill mul and div Array
int []mul = new int[n + 1];
int []div = new int[n + 1];
for (int i = 0; i < n + 1; i++)
{
mul[i] = div[i] = 1;
}
update(0, 1, 10, mul, div);
update(1, 3, 20, mul, div);
update(2, 2, 2, mul, div);
initialize(mul, div, n + 1);
printArray(ar, mul, div, n);
}
}
// This code is contributed by Rajput-Ji
Javascript
<script>
// Javascript implementation of the approach
// Creates a mul array for A and returns
// it after filling initial values.
function initialize(mul , div , size)
{
for (i = 1; i < size; i++) {
mul[i] = (mul[i] * mul[i - 1]) / div[i];
}
}
// Does range update
function update(l , r , x , mul , div) {
mul[l] *= x;
div[r + 1] *= x;
}
// Prints updated Array
function printArray(ar , mul , div , n)
{
for (i = 0; i < n; i++) {
ar[i] = ar[i] * mul[i];
document.write(ar[i] + " ");
}
}
// Driver code;
// Array to be updated
var ar = [ 10, 5, 20, 40 ];
var n = ar.length;
// Create and fill mul and div Array
var mul = Array(n + 1).fill(0);
var div = Array(n + 1).fill(0);
for (i = 0; i < n + 1; i++) {
mul[i] = div[i] = 1;
}
update(0, 1, 10, mul, div);
update(1, 3, 20, mul, div);
update(2, 2, 2, mul, div);
initialize(mul, div, n + 1);
printArray(ar, mul, div, n);
// This code contributed by Rajput-Ji
</script>
Producción:
100 1000 800 800
Complejidad de tiempo: O(n)
Espacio Auxiliar: O(n)
Publicación traducida automáticamente
Artículo escrito por RishavSinghMehta y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA