1 solutions

  • 1
    @ 2025-12-7 11:21:09
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n;
    	cin>>n;
    	stack<int> stk;
    	for(int i=1;i<=n;i++) 
    	{
    		int x;
    		cin>>x;
    		while(stk.size()&&stk.top()==x)
    		{
    			x++;
    			stk.pop();//删除
    			//stk.push(x);
    		}
    		stk.push(x);
    	}
    	cout<<stk.size();
    	return 0;
    }
    
    
    • 1

    Information

    ID
    2719
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    10
    Tags
    # Submissions
    4
    Accepted
    3
    Uploaded By