Pagini recente » Cod sursa (job #3182279) | Cod sursa (job #1564595) | Cod sursa (job #1242918) | Cod sursa (job #1680684) | Cod sursa (job #530768)
Cod sursa(job #530768)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
const char iname[] = "nivele.in";
const char oname[] = "nivele.out";
ifstream fin(iname);
ofstream fout(oname);
int n, t, i, v[51000], j;
stack<int> st;
int main()
{
fin >> t;
for(j = 1; j <= t; j ++)
{
fin >> n;
for(i = 1; i <= n; i ++)
fin >> v[i];
for(i = 1; i <= n; i ++)
{
if(st.size() > 0)
{
if(st.top() == v[i])
{
st.pop();
st.push(v[i] - 1);
v[i]--;
v[i - 1]--;
}
else
st.push(v[i]);
}
else
st.push(v[i]);
}
for(i = 1; i <= n; i ++)
if(v[i] == 1)
ct ++;
if(v[1] == v[2])
fout << "DA\n";
else
fout << "NU\n";
}
return 0;
}