Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define maxelem 100
- int main()
- {
- int a[maxelem];
- int i,pom,n,max;
- printf("Vnesete ja dolzinata na nizata:\t");
- scanf("%d",&n);
- printf("Vnesete gi elementite na nizata:\n");
- for(i=0;i<n;i++)
- {
- printf("a[%d]=",i);
- scanf("%d",&a[i]);
- }
- max=a[0];
- for(i=0;i<n;i++)
- {
- if(a[i]>max)
- {
- max=a[i];
- }
- a[i]=a[i]+max;
- }
- printf("\nNizata na izlez ke izgleda\n");
- for(i=0;i<n;i++)
- {
- printf("a[%d]=%d\n",i,a[i]);
- }
- return 0;
- }
- //problem:mi gi zgolemva samo brojchinjata koi se naogjaat po vekje najdeniot maksimum, a prethodnite gi praj *2
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement