Cod sursa(job #1922667)

Utilizator ShutterflyFilip A Shutterfly Data 10 martie 2017 18:21:20
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb

#include <iostream>
#include <stdio.h>
using namespace std;long long ReplacementFor_best[6000001];int
ReplacementFor_maxSUM=-1000000,ReplacementFor_minSUM=1000000;int
ReplacementFor_mx,ReplacementFor_mi,ReplacementFor_begi;int ReplacementFor_SUM;
int main(){freopen("\x73\x73\x6d\x2e\x69\x6e","\x72",
stdin);freopen("\x73\x73\x6d\x2e\x6f\x75\x74","\x77",stdout);int ReplacementFor_Load;
scanf("%d",&ReplacementFor_Load);scanf("%d",&ReplacementFor_best[(0xd2d+202-0xdf7)]);
for(int ReplacementFor_i=(0xd26+209-0xdf6);ReplacementFor_i<ReplacementFor_Load;
ReplacementFor_i++){scanf("%d",ReplacementFor_best[ReplacementFor_i]);if
(ReplacementFor_best[ReplacementFor_i-(0xd26+209-0xdf6)]>=(0xd2d+202-0xdf7))
ReplacementFor_best[ReplacementFor_i]=ReplacementFor_best[ReplacementFor_i-
(0xd26+209-0xdf6)]+ReplacementFor_best[ReplacementFor_i];else{
ReplacementFor_begi=ReplacementFor_i;}if(ReplacementFor_best[ReplacementFor_i]>
ReplacementFor_maxSUM){ReplacementFor_maxSUM=ReplacementFor_best[
ReplacementFor_i],ReplacementFor_mx=ReplacementFor_i;ReplacementFor_mi=
ReplacementFor_begi;}}printf("%d\x20&d\x20%d",ReplacementFor_best[ReplacementFor_mx
],ReplacementFor_mi+(0xd26+209-0xdf6),ReplacementFor_mx+(0xd26+209-0xdf6));}