Cod sursa(job #2457964)
Utilizator | Bogdan Modolea bogdan_modolea | Data | 19 septembrie 2019 10:46:42 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define NMAX 6000000
using namespace std;
string text="ssm";
ifstream fin(text+".in");
ofstream fout(text+".out");
typedef long long ll;
int n,maxi,maxii,maxij;
int sum[NMAX];
int main()
{
int x,i,j;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
sum[i]=sum[i-1]+x;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
x=sum[j]-sum[i-1];
if(x>maxi){
maxi=x;
maxii=i;
maxij=j;
}
}
}
fout<<maxi<<" "<<maxii<<" "<<maxij<<"\n";
return 0;
}