7-15 长城 (30 分)--栈+思维

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <set>
#include <vector>
#include <stack>
#include <functional>
#define int long long
using namespace std;
int n;
int x[100010],y[100010];
bool check(int a,int b,int c)
{
	return (y[b]-y[a])*(x[c]-x[a])<=(y[c]-y[a])*(x[b]-x[a]);
}
signed main()
{
	cin>>n;
	stack<int>stk;set<int>res;
	for(int i=0;i<n;i++)cin>>x[i]>>y[i];
	for(int i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
		if(stk.size()>=1)
		{
			while(stk.size()>=2)
			{
				int b=stk.top();
				stk.pop();
				int c=stk.top();
				if(!check(i,b,c))
				{
					stk.push(b);
					break;
				}
			}
			if(stk.top())res.insert(stk.top());
		}
		stk.push(i);
	}
	cout<<res.size()<<endl;
}