Cod sursa(job #2176826)
Utilizator | Data | 18 martie 2018 09:13:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<bits/stdc++.h>
using namespace std;
const int N=6000020;
int dp[N], n, t[N];
int main(){
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
dp[0]=-1;
int x;
int mx=-1e9, poz;
for(int i=1;i<=n;i++){
f>>x;
if(dp[i-1]>=0){
dp[i]=dp[i-1]+x;
t[i]=t[i-1];
}else{
dp[i]=x;
t[i]=i;
}
if(mx<dp[i]){
mx=dp[i];
poz=i;
}
}
g<<mx<<' '<<t[poz]<<' '<<poz;
}