fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main(void) {
  4. int N,x,a;
  5. int y,max=0;
  6. scanf("%d", &N);
  7. int tab[N];
  8. int tablica[1000000];
  9. int tabk[N];
  10. for(int i = 1; i<N+1; i++)
  11. 	{
  12. 		scanf("%d", &x);
  13. 		tablica[i]=x;
  14. 		tab[i]=tab[i-1]+tablica[i];
  15. 	}
  16. for (int i = 1; i<N+1; i++)
  17. {
  18. 	for(int i = 1; i<N+1; i++)
  19. 		{
  20. 			if(tab[i]>(tab[N]-tab[i]) && y<tab[N]-tab[i])
  21. 					{
  22. 						y=(tab[N]-tab[i]);
  23. 					}
  24. 			else if(tab[i]<(tab[N]-tab[i]) && y<tab[i])
  25. 				{
  26. 					y=tab[i];
  27. 				}
  28. 		}
  29. 	tabk[i]=y;
  30. 	y=0;
  31. 	a=tablica[1];
  32. 		for(int i = 1; i<N; i++)
  33. 			{
  34. 				tablica[i]=tablica[i+1];
  35. 			}
  36. 		tablica[N]=a;
  37. 		for(int i = 1; i<N+1; i++)
  38. 		{
  39. 		tab[i]=tab[i-1]+tablica[i];
  40. 		}
  41. }
  42. for(int i = 1;i<N;i++)
  43. {
  44. 	if (tabk[i]>max)
  45. 		{
  46. 			max=tabk[i];
  47. 		}
  48. }
  49. printf("%d",max);
  50. 	return 0;
  51. }
  52.  
Success #stdin #stdout 0s 4460KB
comments (?)
stdin
copy 
200
9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121 9 2 3 200 7 51 6 23 612 121
stdout
copy 
10338
https://ideone.com/ezvTA4
language:
C (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!