Cod sursa(job #2649865)
Utilizator | Data | 16 septembrie 2020 17:56:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
#include <queue>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000100];
int main()
{
int n;
f>>n;
for(int i = 1; i<=n; ++i)
f>>a[i];
g<<"0\n";
return 0;
}